Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1010110011101000001010 |
3 | 1110022100111211110011212000 |
4 | 2201203221322303220022 |
5 | 2423344120210000020 |
6 | 35340124333331430 |
7 | 2224046611645014 |
oct | 241435172635012 |
9 | 43270454404760 |
10 | 11102120000010 |
11 | 35a0423343436 |
12 | 12b37b9636b76 |
13 | 626c05204a70 |
14 | 2a54b9dab1b4 |
15 | 143bd1aac090 |
hex | a18e9eb3a0a |
11102120000010 has 128 divisors (see below), whose sum is σ = 32094158584320. Its totient is φ = 2714731200000.
The previous prime is 11102119999991. The next prime is 11102120000051. The reversal of 11102120000010 is 1000002120111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11102119999947 and 11102120000001.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9943491 + ... + 11003510.
It is an arithmetic number, because the mean of its divisors is an integer number (250735613940).
Almost surely, 211102120000010 is an apocalyptic number.
11102120000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11102120000010 is an abundant number, since it is smaller than the sum of its proper divisors (20992038584310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102120000010 is a wasteful number, since it uses less digits than its factorization.
11102120000010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20947181 (or 20947175 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11102120000010 its reverse (1000002120111), we get a palindrome (12102122120121).
The spelling of 11102120000010 in words is "eleven trillion, one hundred two billion, one hundred twenty million, ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •