Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1011111010001000101011 |
3 | 1022210121112201101112020112 |
4 | 2103020231023322020223 |
5 | 2311130023421024321 |
6 | 33300551425444535 |
7 | 2062334521246115 |
oct | 223105513721053 |
9 | 38717481345215 |
10 | 10111111111211 |
11 | 3249109698460 |
12 | 11737267a074b |
13 | 5846208c6686 |
14 | 26d547b043b5 |
15 | 12802e868a5b |
hex | 9322d2fa22b |
10111111111211 has 4 divisors (see below), whose sum is σ = 11030303030424. Its totient is φ = 9191919192000.
The previous prime is 10111111111193. The next prime is 10111111111301. The reversal of 10111111111211 is 11211111111101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111111111211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111117111211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459595959590 + ... + 459595959611.
It is an arithmetic number, because the mean of its divisors is an integer number (2757575757606).
Almost surely, 210111111111211 is an apocalyptic number.
10111111111211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10111111111211 is a deficient number, since it is larger than the sum of its proper divisors (919191919213).
10111111111211 is an equidigital number, since it uses as much as digits as its factorization.
10111111111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919191919212.
The product of its (nonzero) digits is 2, while the sum is 14.
Adding to 10111111111211 its reverse (11211111111101), we get a palindrome (21322222222312).
The spelling of 10111111111211 in words is "ten trillion, one hundred eleven billion, one hundred eleven million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •