Base | Representation |
---|---|
bin | 1010111010100011111101… |
… | …0100101110010001010001 |
3 | 1120111022012100000100021222 |
4 | 2232220333110232101101 |
5 | 3033111424430201113 |
6 | 41305135312054425 |
7 | 2346025643355326 |
oct | 256507724562121 |
9 | 46438170010258 |
10 | 12001201022033 |
11 | 39077541194a3 |
12 | 1419ab5b34415 |
13 | 690929481302 |
14 | 2d6c0b2d6b4d |
15 | 15c2a35ade08 |
hex | aea3f52e451 |
12001201022033 has 2 divisors, whose sum is σ = 12001201022034. Its totient is φ = 12001201022032.
The previous prime is 12001201021897. The next prime is 12001201022039. The reversal of 12001201022033 is 33022010210021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11945546550289 + 55654471744 = 3456233^2 + 235912^2 .
It is a cyclic number.
It is not a de Polignac number, because 12001201022033 - 212 = 12001201017937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12001201022039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000600511016 + 6000600511017.
It is an arithmetic number, because the mean of its divisors is an integer number (6000600511017).
Almost surely, 212001201022033 is an apocalyptic number.
It is an amenable number.
12001201022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001201022033 is an equidigital number, since it uses as much as digits as its factorization.
12001201022033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12001201022033 its reverse (33022010210021), we get a palindrome (45023211232054).
The spelling of 12001201022033 in words is "twelve trillion, one billion, two hundred one million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •