Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1110001101011011111110 |
3 | 1110101001200000002202202202 |
4 | 2201310103232031123332 |
5 | 2424142230302210420 |
6 | 35352242533551502 |
7 | 2225251665505622 |
oct | 241642356153376 |
9 | 43331600082682 |
10 | 11120001210110 |
11 | 35a7a69870221 |
12 | 12b7169aa5592 |
13 | 6287c4943160 |
14 | 2a62d4b15182 |
15 | 1443cb7ed575 |
hex | a1d13b8d6fe |
11120001210110 has 64 divisors (see below), whose sum is σ = 22842872700480. Its totient is φ = 3867576222720.
The previous prime is 11120001210107. The next prime is 11120001210137. The reversal of 11120001210110 is 1101210002111.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11120001210091 and 11120001210100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35816192 + ... + 36125331.
It is an arithmetic number, because the mean of its divisors is an integer number (356919885945).
Almost surely, 211120001210110 is an apocalyptic number.
11120001210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120001210110 is an abundant number, since it is smaller than the sum of its proper divisors (11722871490370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120001210110 is a wasteful number, since it uses less digits than its factorization.
11120001210110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71941613.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11120001210110 its reverse (1101210002111), we get a palindrome (12221211212221).
The spelling of 11120001210110 in words is "eleven trillion, one hundred twenty billion, one million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •