114,364
114,364 is a composite number, even.
114,364 (one hundred fourteen thousand three hundred sixty-four) is an even 6-digit number. It is a composite number with 6 divisors, and factors as 2² × 28,591. Written other ways, in hexadecimal, 0x1BEBC.
Interestingness
Properties
- Parity
- Even
- Digit count
- 6
- Digit sum
- 19
- Digit product
- 288
- Digital root
- 1
- Palindrome
- No
- Bit width
- 17 bits
- Reversed
- 463,411
- Recamán's sequence
- a(57,515) = 114,364
- Square (n²)
- 13,079,124,496
- Cube (n³)
- 1,495,780,993,860,544
- Divisor count
- 6
- σ(n) — sum of divisors
- 200,144
- φ(n) — Euler's totient
- 57,180
- Sum of prime factors
- 28,595
Primality
Prime factorization: 2 2 × 28591
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√114,364 = [338; (5, 1, 1, 1, 2, 1, 4, 1, 1, 2, 225, 16, 1, 9, 2, 6, 2, 74, 1, 2, 5, 3, 3, 6, …)]
Representations
- In words
- one hundred fourteen thousand three hundred sixty-four
- Ordinal
- 114364th
- Binary
- 11011111010111100
- Octal
- 337274
- Hexadecimal
- 0x1BEBC
- Base64
- Ab68
- One's complement
- 4,294,852,931 (32-bit)
- Scientific notation
- 1.14364 × 10⁵
- As a duration
- 114,364 s = 1 day, 7 hours, 46 minutes, 4 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒌋𒌋𒌋𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓂍𓆼𓆼𓆼𓆼𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵ριδτξδʹ
- Mayan (base 20)
- 𝋮·𝋥·𝋲·𝋤
- Chinese
- 一十一萬四千三百六十四
- Chinese (financial)
- 壹拾壹萬肆仟參佰陸拾肆
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 114364, here are decompositions:
- 53 + 114311 = 114364
- 83 + 114281 = 114364
- 167 + 114197 = 114364
- 197 + 114167 = 114364
- 251 + 114113 = 114364
- 281 + 114083 = 114364
- 401 + 113963 = 114364
- 431 + 113933 = 114364
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 0.1.190.188.
- Address
- 0.1.190.188
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.1.190.188
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 114,364 and was likely granted around 1871.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 114364 first appears in π at position 858,602 of the decimal expansion (the 858,602ordinal-suffix:nd digit after the integer 3).
Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.
Related reading
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.