Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110101010010101010 |
3 | 1110101001122222220202002210 |
4 | 2201310103231311102222 |
5 | 2424142230241024320 |
6 | 35352242531505550 |
7 | 2225251664614365 |
oct | 241642355652252 |
9 | 43331588822083 |
10 | 11120001111210 |
11 | 35a7a69802992 |
12 | 12b7169a582b6 |
13 | 6287c490a134 |
14 | 2a62d4acb0dc |
15 | 1443cb7ce0e0 |
hex | a1d13b754aa |
11120001111210 has 64 divisors (see below), whose sum is σ = 26943261092352. Its totient is φ = 2936983596096.
The previous prime is 11120001111199. The next prime is 11120001111221. The reversal of 11120001111210 is 1211110002111.
11120001111210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11120001111199) and next prime (11120001111221).
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, 14530977 + ... + 15277083.
It is an arithmetic number, because the mean of its divisors is an integer number (420988454568).
Almost surely, 211120001111210 is an apocalyptic number.
11120001111210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120001111210 is an abundant number, since it is smaller than the sum of its proper divisors (15823259981142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120001111210 is a wasteful number, since it uses less digits than its factorization.
11120001111210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750867.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11120001111210 its reverse (1211110002111), we get a palindrome (12331111113321).
The spelling of 11120001111210 in words is "eleven trillion, one hundred twenty billion, one million, one hundred eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •