Base | Representation |
---|---|
bin | 10000001010101110000… |
… | …101010110100010110010 |
3 | 10221012202001021121000210 |
4 | 100022232011112202302 |
5 | 121200333140413020 |
6 | 2210221353324550 |
7 | 143161110614241 |
oct | 20125605264262 |
9 | 3835661247023 |
10 | 1111022201010 |
11 | 399200082827 |
12 | 15b3a7106756 |
13 | 809cc4a6ac7 |
14 | 3bab92b6958 |
15 | 1dd784783e0 |
hex | 102ae1568b2 |
1111022201010 has 64 divisors (see below), whose sum is σ = 2671567557120. Its totient is φ = 295704821760.
The previous prime is 1111022200999. The next prime is 1111022201041. The reversal of 1111022201010 is 101022201111.
It is a super-2 number, since 2×11110222010102 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39689479 + ... + 39717461.
It is an arithmetic number, because the mean of its divisors is an integer number (41743243080).
Almost surely, 21111022201010 is an apocalyptic number.
1111022201010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111022201010 is an abundant number, since it is smaller than the sum of its proper divisors (1560545356110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111022201010 is a wasteful number, since it uses less digits than its factorization.
1111022201010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30483.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1111022201010 its reverse (101022201111), we get a palindrome (1212044402121).
The spelling of 1111022201010 in words is "one trillion, one hundred eleven billion, twenty-two million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •