Base | Representation |
---|---|
bin | 10110010111110101… |
… | …10101010010000001 |
3 | 1011000002001201121222 |
4 | 23023322311102001 |
5 | 144044322211113 |
6 | 5303504124425 |
7 | 603434636435 |
oct | 131372652201 |
9 | 34002051558 |
10 | 12011132033 |
11 | 5103a752aa |
12 | 23b2606715 |
13 | 1195561724 |
14 | 81d2b89c5 |
15 | 4a471de08 |
hex | 2cbeb5481 |
12011132033 has 2 divisors, whose sum is σ = 12011132034. Its totient is φ = 12011132032.
The previous prime is 12011131997. The next prime is 12011132041. The reversal of 12011132033 is 33023111021.
12011132033 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 can be written as a sum of positive squares in only one way, i.e., 9372563344 + 2638568689 = 96812^2 + 51367^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011132033 - 26 = 12011131969 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 (12011132053) 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, 6005566016 + 6005566017.
It is an arithmetic number, because the mean of its divisors is an integer number (6005566017).
Almost surely, 212011132033 is an apocalyptic number.
It is an amenable number.
12011132033 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011132033 is an equidigital number, since it uses as much as digits as its factorization.
12011132033 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 17.
Adding to 12011132033 its reverse (33023111021), we get a palindrome (45034243054).
The spelling of 12011132033 in words is "twelve billion, eleven million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •