Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0100011000110010001011 |
3 | 1022202112220010121000121201 |
4 | 2102332113210120302023 |
5 | 2310434310304324321 |
6 | 33251514144045031 |
7 | 2061462455043412 |
oct | 222762744306213 |
9 | 38675803530551 |
10 | 10100011011211 |
11 | 32444329aaaa0 |
12 | 1171549303777 |
13 | 583572021b74 |
14 | 26cbb3818479 |
15 | 127ad0105291 |
hex | 92f97918c8b |
10100011011211 has 16 divisors (see below), whose sum is σ = 11223196807680. Its totient is φ = 9012566904480.
The previous prime is 10100011011193. The next prime is 10100011011253. The reversal of 10100011011211 is 11211011000101.
10100011011211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10100011011211 - 25 = 10100011011179 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10100011011911) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39234771 + ... + 39491356.
It is an arithmetic number, because the mean of its divisors is an integer number (701449800480).
Almost surely, 210100011011211 is an apocalyptic number.
10100011011211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10100011011211 is a deficient number, since it is larger than the sum of its proper divisors (1123185796469).
10100011011211 is a wasteful number, since it uses less digits than its factorization.
10100011011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78726354.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 10100011011211 its reverse (11211011000101), we get a palindrome (21311022011312).
The spelling of 10100011011211 in words is "ten trillion, one hundred billion, eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •