Base | Representation |
---|---|
bin | 10110011010001111… |
… | …11000011110101001 |
3 | 1011001111001220022212 |
4 | 23031013320132221 |
5 | 144120010031332 |
6 | 5305505054505 |
7 | 604101422324 |
oct | 131507703651 |
9 | 34044056285 |
10 | 12031330217 |
11 | 5114410515 |
12 | 23b9327435 |
13 | 11997b410a |
14 | 821c557bb |
15 | 4a63ad8b2 |
hex | 2cd1f87a9 |
12031330217 has 2 divisors, whose sum is σ = 12031330218. Its totient is φ = 12031330216.
The previous prime is 12031330177. The next prime is 12031330247. The reversal of 12031330217 is 71203313021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11949987856 + 81342361 = 109316^2 + 9019^2 .
It is an emirp because it is prime and its reverse (71203313021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12031330217 - 230 = 10957588393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12031330192 and 12031330201.
It is not a weakly prime, because it can be changed into another prime (12031330247) 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, 6015665108 + 6015665109.
It is an arithmetic number, because the mean of its divisors is an integer number (6015665109).
Almost surely, 212031330217 is an apocalyptic number.
It is an amenable number.
12031330217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12031330217 is an equidigital number, since it uses as much as digits as its factorization.
12031330217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 12031330217 its reverse (71203313021), we get a palindrome (83234643238).
The spelling of 12031330217 in words is "twelve billion, thirty-one million, three hundred thirty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •