Base | Representation |
---|---|
bin | 1010001100100101000000… |
… | …1100001101010010101010 |
3 | 1110200210002111120101100010 |
4 | 2203021100030031102222 |
5 | 2432141024231120020 |
6 | 35502205255152350 |
7 | 2234661143552400 |
oct | 243112014152252 |
9 | 43623074511303 |
10 | 11211210020010 |
11 | 3632713865060 |
12 | 13109836756b6 |
13 | 63429c022860 |
14 | 2aa8a8397470 |
15 | 146968d55de0 |
hex | a325030d4aa |
11211210020010 has 192 divisors, whose sum is σ = 36771873554304. Its totient is φ = 2150401881600.
The previous prime is 11211210019987. The next prime is 11211210020027. The reversal of 11211210020010 is 1002001211211.
It is a super-2 number, since 2×112112100200102 (a number of 27 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 95 ways as a sum of consecutive naturals, for example, 26456481 + ... + 26876900.
It is an arithmetic number, because the mean of its divisors is an integer number (191520174762).
Almost surely, 211211210020010 is an apocalyptic number.
11211210020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11211210020010 is an abundant number, since it is smaller than the sum of its proper divisors (25560663534294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211210020010 is a wasteful number, since it uses less digits than its factorization.
11211210020010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53333429 (or 53333422 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11211210020010 its reverse (1002001211211), we get a palindrome (12213211231221).
The spelling of 11211210020010 in words is "eleven trillion, two hundred eleven billion, two hundred ten million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •