Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …100100011110011000011 |
3 | 11021212200002201012210211 |
4 | 101220313130203303003 |
5 | 124324400404323021 |
6 | 2324500333334551 |
7 | 153400145412025 |
oct | 21506734436303 |
9 | 4255602635724 |
10 | 1212111011011 |
11 | 42806507a9aa |
12 | 176ab9637457 |
13 | 8a3bc749b04 |
14 | 42948ba2015 |
15 | 217e30883e1 |
hex | 11a37723cc3 |
1212111011011 has 4 divisors (see below), whose sum is σ = 1275906327400. Its totient is φ = 1148315694624.
The previous prime is 1212111010931. The next prime is 1212111011057. The reversal of 1212111011011 is 1101101112121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1212111011011 - 219 = 1212110486723 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1212111010982 and 1212111011000.
It is not an unprimeable number, because it can be changed into a prime (1212111011071) 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, 31897658166 + ... + 31897658203.
It is an arithmetic number, because the mean of its divisors is an integer number (318976581850).
Almost surely, 21212111011011 is an apocalyptic number.
1212111011011 is a deficient number, since it is larger than the sum of its proper divisors (63795316389).
1212111011011 is an equidigital number, since it uses as much as digits as its factorization.
1212111011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63795316388.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1212111011011 its reverse (1101101112121), we get a palindrome (2313212123132).
It can be divided in two parts, 12121 and 11011011, that multiplied together give a palindrome (133464464331).
The spelling of 1212111011011 in words is "one trillion, two hundred twelve billion, one hundred eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •