Base | Representation |
---|---|
bin | 10001101000110001011… |
… | …100000000001110011011 |
3 | 11021212102002000120212011 |
4 | 101220301130000032123 |
5 | 124324144102431021 |
6 | 2324442332530351 |
7 | 153364512510160 |
oct | 21506134001633 |
9 | 4255362016764 |
10 | 1212010202011 |
11 | 428013186684 |
12 | 176a8b9209b7 |
13 | 8a3a48b200b |
14 | 42939640067 |
15 | 217d92c3de1 |
hex | 11a3170039b |
1212010202011 has 8 divisors (see below), whose sum is σ = 1386581048064. Its totient is φ = 1037795988840.
The previous prime is 1212010202009. The next prime is 1212010202041. The reversal of 1212010202011 is 1102020102121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1212010202011 - 21 = 1212010202009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212010201982 and 1212010202000.
It is not an unprimeable number, because it can be changed into a prime (1212010202041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89150935 + ... + 89164528.
It is an arithmetic number, because the mean of its divisors is an integer number (173322631008).
Almost surely, 21212010202011 is an apocalyptic number.
1212010202011 is a deficient number, since it is larger than the sum of its proper divisors (174570846053).
1212010202011 is an equidigital number, since it uses as much as digits as its factorization.
1212010202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178316441.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1212010202011 its reverse (1102020102121), we get a palindrome (2314030304132).
The spelling of 1212010202011 in words is "one trillion, two hundred twelve billion, ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •