Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …001011101110011001010 |
3 | 11021212200001012000022202 |
4 | 101220313121131303022 |
5 | 124324400202400020 |
6 | 2324500304120202 |
7 | 153400135463423 |
oct | 21506731356312 |
9 | 4255601160282 |
10 | 1212110200010 |
11 | 428064676656 |
12 | 176ab9306062 |
13 | 8a3bc524928 |
14 | 42948a3064a |
15 | 217e2e77e75 |
hex | 11a3765dcca |
1212110200010 has 8 divisors (see below), whose sum is σ = 2181798360036. Its totient is φ = 484844080000.
The previous prime is 1212110200001. The next prime is 1212110200013. The reversal of 1212110200010 is 100020112121.
It can be written as a sum of positive squares in 2 ways, for example, as 1175986256041 + 36123943969 = 1084429^2 + 190063^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12121102000102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212110199964 and 1212110200000.
It is not an unprimeable number, because it can be changed into a prime (1212110200013) 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, 60605509991 + ... + 60605510010.
Almost surely, 21212110200010 is an apocalyptic number.
1212110200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1212110200010 is a deficient number, since it is larger than the sum of its proper divisors (969688160026).
1212110200010 is a wasteful number, since it uses less digits than its factorization.
1212110200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121211020008.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1212110200010 its reverse (100020112121), we get a palindrome (1312130312131).
The spelling of 1212110200010 in words is "one trillion, two hundred twelve billion, one hundred ten million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •