Base | Representation |
---|---|
bin | 110101000110001000… |
… | …1101101010110001101 |
3 | 101220022102122100002222 |
4 | 1222030101231112031 |
5 | 3332004241232000 |
6 | 124214204025125 |
7 | 11144405061305 |
oct | 1521421552615 |
9 | 356272570088 |
10 | 114022602125 |
11 | 443a1871683 |
12 | 1a121b321a5 |
13 | a9a1a03253 |
14 | 573953c605 |
15 | 2e75334a85 |
hex | 1a8c46d58d |
114022602125 has 8 divisors (see below), whose sum is σ = 142300207608. Its totient is φ = 91218081600.
The previous prime is 114022602121. The next prime is 114022602139. The reversal of 114022602125 is 521206220411.
It can be written as a sum of positive squares in 4 ways, for example, as 26426728969 + 87595873156 = 162563^2 + 295966^2 .
It is not a de Polignac number, because 114022602125 - 22 = 114022602121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114022602094 and 114022602103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114022602121) 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, 456090284 + ... + 456090533.
It is an arithmetic number, because the mean of its divisors is an integer number (17787525951).
Almost surely, 2114022602125 is an apocalyptic number.
It is an amenable number.
114022602125 is a deficient number, since it is larger than the sum of its proper divisors (28277605483).
114022602125 is an frugal number, since it uses more digits than its factorization.
114022602125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 912180832 (or 912180822 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 114022602125 its reverse (521206220411), we get a palindrome (635228822536).
The spelling of 114022602125 in words is "one hundred fourteen billion, twenty-two million, six hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •