Base | Representation |
---|---|
bin | 1001001100100011001010… |
… | …0111011101110010011011 |
3 | 1022210121210001211101122222 |
4 | 2103020302213131302123 |
5 | 2311130220232034321 |
6 | 33301004442334255 |
7 | 2062340005544000 |
oct | 223106247356233 |
9 | 38717701741588 |
10 | 10111202221211 |
11 | 3249156067783 |
12 | 11737511ba38b |
13 | 584636746910 |
14 | 26d555c5d8a7 |
15 | 1280378643ab |
hex | 932329ddc9b |
10111202221211 has 64 divisors (see below), whose sum is σ = 13165740000000. Its totient is φ = 7706960142336.
The previous prime is 10111202221151. The next prime is 10111202221249. The reversal of 10111202221211 is 11212220211101.
It is not a de Polignac number, because 10111202221211 - 234 = 10094022352027 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10111202221211.
It is not an unprimeable number, because it can be changed into a prime (10111202221511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57973565 + ... + 58147713.
It is an arithmetic number, because the mean of its divisors is an integer number (205714687500).
Almost surely, 210111202221211 is an apocalyptic number.
10111202221211 is a deficient number, since it is larger than the sum of its proper divisors (3054537778789).
10111202221211 is a wasteful number, since it uses less digits than its factorization.
10111202221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174661 (or 174647 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10111202221211 its reverse (11212220211101), we get a palindrome (21323422432312).
The spelling of 10111202221211 in words is "ten trillion, one hundred eleven billion, two hundred two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •