Base | Representation |
---|---|
bin | 11010000001000110110100… |
… | …111111000100101110101111 |
3 | 120000010221121010021020121002 |
4 | 122001012310333010232233 |
5 | 104444220413100303223 |
6 | 1043210123331030515 |
7 | 33046644421351010 |
oct | 3201066477045657 |
9 | 500127533236532 |
10 | 114425260166063 |
11 | 33506531337860 |
12 | 10a0047013b43b |
13 | 4bb0342b03442 |
14 | 20382d8191007 |
15 | d366e4a29e28 |
hex | 6811b4fc4baf |
114425260166063 has 8 divisors (see below), whose sum is σ = 142660064622720. Its totient is φ = 89162540389080.
The previous prime is 114425260166023. The next prime is 114425260166099. The reversal of 114425260166063 is 360661062524411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114425260166063 - 212 = 114425260161967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114425260165999 and 114425260166017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114425260166003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 743021169833 + ... + 743021169986.
It is an arithmetic number, because the mean of its divisors is an integer number (17832508077840).
Almost surely, 2114425260166063 is an apocalyptic number.
114425260166063 is a deficient number, since it is larger than the sum of its proper divisors (28234804456657).
114425260166063 is a wasteful number, since it uses less digits than its factorization.
114425260166063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486042339837.
The product of its (nonzero) digits is 1244160, while the sum is 47.
The spelling of 114425260166063 in words is "one hundred fourteen trillion, four hundred twenty-five billion, two hundred sixty million, one hundred sixty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •