Base | Representation |
---|---|
bin | 10110011010010110… |
… | …01111010011010011 |
3 | 1011001112201121100021 |
4 | 23031023033103103 |
5 | 144120221211011 |
6 | 5305540004311 |
7 | 604112045554 |
oct | 131513172323 |
9 | 34045647307 |
10 | 12032210131 |
11 | 5114961617 |
12 | 23b9690697 |
13 | 1199a31786 |
14 | 82200432b |
15 | 4a64d4471 |
hex | 2cd2cf4d3 |
12032210131 has 2 divisors, whose sum is σ = 12032210132. Its totient is φ = 12032210130.
The previous prime is 12032210111. The next prime is 12032210147. The reversal of 12032210131 is 13101223021.
It is an a-pointer prime, because the next prime (12032210147) can be obtained adding 12032210131 to its sum of digits (16).
It is a strong prime.
It is an emirp because it is prime and its reverse (13101223021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12032210131 - 219 = 12031685843 is a prime.
It is a super-2 number, since 2×120322101312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12032210111) 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, 6016105065 + 6016105066.
It is an arithmetic number, because the mean of its divisors is an integer number (6016105066).
Almost surely, 212032210131 is an apocalyptic number.
12032210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12032210131 is an equidigital number, since it uses as much as digits as its factorization.
12032210131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12032210131 its reverse (13101223021), we get a palindrome (25133433152).
The spelling of 12032210131 in words is "twelve billion, thirty-two million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •