Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0000001010111001110110 |
3 | 1022110001110011111212002002 |
4 | 2101223211100022321312 |
5 | 2303010233211133420 |
6 | 33143013421415302 |
7 | 2052164613100025 |
oct | 221534520127166 |
9 | 38401404455062 |
10 | 10011120021110 |
11 | 320a76829850a |
12 | 115827ba0a532 |
13 | 578076bb6580 |
14 | 26877dd228bc |
15 | 12562b2de075 |
hex | 91ae540ae76 |
10011120021110 has 32 divisors (see below), whose sum is σ = 19415889283392. Its totient is φ = 3694562467200.
The previous prime is 10011120021013. The next prime is 10011120021113. The reversal of 10011120021110 is 1112002111001.
It is a junction number, because it is equal to n+sod(n) for n = 10011120021091 and 10011120021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011120021113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19021466 + ... + 19540685.
It is an arithmetic number, because the mean of its divisors is an integer number (606746540106).
Almost surely, 210011120021110 is an apocalyptic number.
10011120021110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011120021110 is a deficient number, since it is larger than the sum of its proper divisors (9404769262282).
10011120021110 is a wasteful number, since it uses less digits than its factorization.
10011120021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38564168.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10011120021110 its reverse (1112002111001), we get a palindrome (11123122132111).
The spelling of 10011120021110 in words is "ten trillion, eleven billion, one hundred twenty million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •