Base | Representation |
---|---|
bin | 1010000110101111110100… |
… | …0000001001101111100100 |
3 | 1110100012111210101022100220 |
4 | 2201223331000021233210 |
5 | 2424020342201244022 |
6 | 35344200424004340 |
7 | 2224513453402500 |
oct | 241537500115744 |
9 | 43305453338326 |
10 | 11111030103012 |
11 | 35a4185913724 |
12 | 12b54856006b0 |
13 | 6279c516ac68 |
14 | 2a5ac34a1300 |
15 | 144053e2c85c |
hex | a1afd009be4 |
11111030103012 has 72 divisors (see below), whose sum is σ = 30159168248160. Its totient is φ = 3174510769920.
The previous prime is 11111030103011. The next prime is 11111030103031. The reversal of 11111030103012 is 21030103011111.
It is a junction number, because it is equal to n+sod(n) for n = 11111030102982 and 11111030103000.
It is not an unprimeable number, because it can be changed into a prime (11111030103011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30707187 + ... + 31066917.
It is an arithmetic number, because the mean of its divisors is an integer number (418877336780).
Almost surely, 211111030103012 is an apocalyptic number.
11111030103012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11111030103012 is an abundant number, since it is smaller than the sum of its proper divisors (19048138145148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111030103012 is a wasteful number, since it uses less digits than its factorization.
11111030103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412281 (or 412272 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 11111030103012 its reverse (21030103011111), we get a palindrome (32141133114123).
The spelling of 11111030103012 in words is "eleven trillion, one hundred eleven billion, thirty million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.298 sec. • engine limits •