Base | Representation |
---|---|
bin | 11100011101001100111001… |
… | …001101111101111101010110 |
3 | 121102010102012220021220212211 |
4 | 130131030321031331331112 |
5 | 112400442310033013420 |
6 | 1122102012434104034 |
7 | 35234635345505113 |
oct | 3435147115757526 |
9 | 542112186256784 |
10 | 125152012001110 |
11 | 36971741083056 |
12 | 1205336b71b01a |
13 | 54aaa2685a093 |
14 | 22c95654a790a |
15 | e707573d9e5a |
hex | 71d33937df56 |
125152012001110 has 32 divisors (see below), whose sum is σ = 225635183478432. Its totient is φ = 49980513127680.
The previous prime is 125152012001087. The next prime is 125152012001123. The reversal of 125152012001110 is 11100210251521.
It is a happy number.
It is a super-2 number, since 2×1251520120011102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14614780 + ... + 21538240.
It is an arithmetic number, because the mean of its divisors is an integer number (7051099483701).
Almost surely, 2125152012001110 is an apocalyptic number.
125152012001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125152012001110 is a deficient number, since it is larger than the sum of its proper divisors (100483171477322).
125152012001110 is a wasteful number, since it uses less digits than its factorization.
125152012001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6926368.
The product of its (nonzero) digits is 200, while the sum is 22.
Adding to 125152012001110 its reverse (11100210251521), we get a palindrome (136252222252631).
The spelling of 125152012001110 in words is "one hundred twenty-five trillion, one hundred fifty-two billion, twelve million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •