Base | Representation |
---|---|
bin | 10110011010011100… |
… | …10000011100001111 |
3 | 1011001121012210112021 |
4 | 23031032100130033 |
5 | 144120422014411 |
6 | 5310004551011 |
7 | 604121552146 |
oct | 131516203417 |
9 | 34047183467 |
10 | 12033001231 |
11 | 5115351a19 |
12 | 23b99b2467 |
13 | 1199c4a894 |
14 | 82216c75d |
15 | 4a65dda71 |
hex | 2cd39070f |
12033001231 has 2 divisors, whose sum is σ = 12033001232. Its totient is φ = 12033001230.
The previous prime is 12033001187. The next prime is 12033001243. The reversal of 12033001231 is 13210033021.
12033001231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (13210033021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12033001231 - 211 = 12032999183 is a prime.
It is a super-2 number, since 2×120330012312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12033001271) 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, 6016500615 + 6016500616.
It is an arithmetic number, because the mean of its divisors is an integer number (6016500616).
Almost surely, 212033001231 is an apocalyptic number.
12033001231 is a deficient number, since it is larger than the sum of its proper divisors (1).
12033001231 is an equidigital number, since it uses as much as digits as its factorization.
12033001231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12033001231 its reverse (13210033021), we get a palindrome (25243034252).
The spelling of 12033001231 in words is "twelve billion, thirty-three million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •