Base | Representation |
---|---|
bin | 10110010110110001… |
… | …10110010001110111 |
3 | 1010222110022010001001 |
4 | 23023120312101313 |
5 | 144040032120343 |
6 | 5302545144131 |
7 | 603266133304 |
oct | 131330662167 |
9 | 33873263031 |
10 | 12002223223 |
11 | 50a9a3aa51 |
12 | 23ab62b047 |
13 | 1193762743 |
14 | 81c03a0ab |
15 | 4a3a5e44d |
hex | 2cb636477 |
12002223223 has 2 divisors, whose sum is σ = 12002223224. Its totient is φ = 12002223222.
The previous prime is 12002223203. The next prime is 12002223229. The reversal of 12002223223 is 32232220021.
It is a strong prime.
It is an emirp because it is prime and its reverse (32232220021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12002223223 - 29 = 12002222711 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12002223223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12002223229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001111611 + 6001111612.
It is an arithmetic number, because the mean of its divisors is an integer number (6001111612).
Almost surely, 212002223223 is an apocalyptic number.
12002223223 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002223223 is an equidigital number, since it uses as much as digits as its factorization.
12002223223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 12002223223 its reverse (32232220021), we get a palindrome (44234443244).
It can be divided in two parts, 12002 and 223223, that added together give a square (235225 = 4852).
The spelling of 12002223223 in words is "twelve billion, two million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •