Base | Representation |
---|---|
bin | 11001111010111110101101… |
… | …011010110000101000111000 |
3 | 112221122200211112222102002100 |
4 | 121322332231122300220320 |
5 | 104420321123430123224 |
6 | 1042244452452303400 |
7 | 33004351002444063 |
oct | 3172765532605070 |
9 | 487580745872070 |
10 | 114004226411064 |
11 | 33363a147a7a70 |
12 | 10952948911b60 |
13 | 4b7c724892132 |
14 | 2021b966cd8da |
15 | d2a7a1767ac9 |
hex | 67afad6b0a38 |
114004226411064 has 48 divisors (see below), whose sum is σ = 336830668944120. Its totient is φ = 34546735275840.
The previous prime is 114004226411057. The next prime is 114004226411099. The reversal of 114004226411064 is 460114622400411.
114004226411064 is a `hidden beast` number, since 1 + 1 + 4 + 0 + 0 + 4 + 2 + 2 + 641 + 1 + 0 + 6 + 4 = 666.
It is a super-2 number, since 2×1140042264110642 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71972364367 + ... + 71972365950.
Almost surely, 2114004226411064 is an apocalyptic number.
It is an amenable number.
114004226411064 is an abundant number, since it is smaller than the sum of its proper divisors (222826442533056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114004226411064 is a wasteful number, since it uses less digits than its factorization.
114004226411064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143944730340 (or 143944730333 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
Adding to 114004226411064 its reverse (460114622400411), we get a palindrome (574118848811475).
The spelling of 114004226411064 in words is "one hundred fourteen trillion, four billion, two hundred twenty-six million, four hundred eleven thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •