Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …101110111001101011111 |
3 | 11020201221211211112020201 |
4 | 101131302031313031133 |
5 | 124131013300042343 |
6 | 2315211514524331 |
7 | 152466242425015 |
oct | 21356215671537 |
9 | 4221854745221 |
10 | 1200212112223 |
11 | 4230094a2153 |
12 | 1747387366a7 |
13 | 892445230b7 |
14 | 4213a7808b5 |
15 | 2134863894d |
hex | 1177237735f |
1200212112223 has 2 divisors, whose sum is σ = 1200212112224. Its totient is φ = 1200212112222.
The previous prime is 1200212112181. The next prime is 1200212112227. The reversal of 1200212112223 is 3222112120021.
It is a strong prime.
It is an emirp because it is prime and its reverse (3222112120021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1200212112223 - 29 = 1200212111711 is a prime.
It is a super-2 number, since 2×12002121122232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1200212112223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200212112227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600106056111 + 600106056112.
It is an arithmetic number, because the mean of its divisors is an integer number (600106056112).
Almost surely, 21200212112223 is an apocalyptic number.
1200212112223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200212112223 is an equidigital number, since it uses as much as digits as its factorization.
1200212112223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1200212112223 its reverse (3222112120021), we get a palindrome (4422324232244).
The spelling of 1200212112223 in words is "one trillion, two hundred billion, two hundred twelve million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •