Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0100111110000101101011 |
3 | 1022210121022110020011201112 |
4 | 2103020213310332011223 |
5 | 2311124332412241021 |
6 | 33300534454540535 |
7 | 2062332350153246 |
oct | 223104764760553 |
9 | 38717273204645 |
10 | 10111021212011 |
11 | 32490729758a5 |
12 | 117370066774b |
13 | 5846080ab595 |
14 | 26d539bc225d |
15 | 128026a0bd5b |
hex | 93227d3e16b |
10111021212011 has 32 divisors (see below), whose sum is σ = 10593115977216. Its totient is φ = 9639751680000.
The previous prime is 10111021212007. The next prime is 10111021212151. The reversal of 10111021212011 is 11021212011101.
It is a cyclic number.
It is not a de Polignac number, because 10111021212011 - 22 = 10111021212007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111021214011) 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 31 ways as a sum of consecutive naturals, for example, 565452791 + ... + 565470671.
It is an arithmetic number, because the mean of its divisors is an integer number (331034874288).
Almost surely, 210111021212011 is an apocalyptic number.
10111021212011 is a deficient number, since it is larger than the sum of its proper divisors (482094765205).
10111021212011 is a wasteful number, since it uses less digits than its factorization.
10111021212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18903.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10111021212011 its reverse (11021212011101), we get a palindrome (21132233223112).
It can be divided in two parts, 101 and 11021212011, that multiplied together give a palindrome (1113142413111).
The spelling of 10111021212011 in words is "ten trillion, one hundred eleven billion, twenty-one million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •