Base | Representation |
---|---|
bin | 1011000111011011010010… |
… | …0111100000000101000011 |
3 | 1121021102122222120000112202 |
4 | 2301312310213200011003 |
5 | 3100222042311223021 |
6 | 41554450132543415 |
7 | 2401011545441135 |
oct | 261666447400503 |
9 | 47242588500482 |
10 | 12222212211011 |
11 | 3992458184990 |
12 | 14548b6181b6b |
13 | 6a871b80208a |
14 | 3037b5ac1055 |
15 | 162ddb440a0b |
hex | b1db49e0143 |
12222212211011 has 4 divisors (see below), whose sum is σ = 13333322412024. Its totient is φ = 11111102010000.
The previous prime is 12222212210963. The next prime is 12222212211019. The reversal of 12222212211011 is 11011221222221.
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-12222212211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12222212211019) 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, 555555100490 + ... + 555555100511.
It is an arithmetic number, because the mean of its divisors is an integer number (3333330603006).
Almost surely, 212222212211011 is an apocalyptic number.
12222212211011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12222212211011 is a deficient number, since it is larger than the sum of its proper divisors (1111110201013).
12222212211011 is a wasteful number, since it uses less digits than its factorization.
12222212211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1111110201012.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 12222212211011 its reverse (11011221222221), we get a palindrome (23233433433232).
The spelling of 12222212211011 in words is "twelve trillion, two hundred twenty-two billion, two hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •