Base | Representation |
---|---|
bin | 10001101000110000110… |
… | …101001000001010011101 |
3 | 11021212101100211211021221 |
4 | 101220300311020022131 |
5 | 124324134000322114 |
6 | 2324441330253341 |
7 | 153364330053412 |
oct | 21506065101235 |
9 | 4255340754257 |
10 | 1212000010909 |
11 | 428008455986 |
12 | 176a88427251 |
13 | 8a3a275448c |
14 | 4293814a109 |
15 | 217d845e524 |
hex | 11a30d4829d |
1212000010909 has 2 divisors, whose sum is σ = 1212000010910. Its totient is φ = 1212000010908.
The previous prime is 1212000010861. The next prime is 1212000011059. The reversal of 1212000010909 is 9090100002121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1181286396900 + 30713614009 = 1086870^2 + 175253^2 .
It is an emirp because it is prime and its reverse (9090100002121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212000010909 - 217 = 1211999879837 is a prime.
It is a super-2 number, since 2×12120000109092 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212000070909) 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 as a sum of consecutive naturals, namely, 606000005454 + 606000005455.
It is an arithmetic number, because the mean of its divisors is an integer number (606000005455).
Almost surely, 21212000010909 is an apocalyptic number.
It is an amenable number.
1212000010909 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212000010909 is an equidigital number, since it uses as much as digits as its factorization.
1212000010909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 1212000010909 in words is "one trillion, two hundred twelve billion, ten thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •