Base | Representation |
---|---|
bin | 10110010111110111… |
… | …01000001010010001 |
3 | 1011000002110022111111 |
4 | 23023323220022101 |
5 | 144044400343213 |
6 | 5303512413321 |
7 | 603436465141 |
oct | 131373501221 |
9 | 34002408444 |
10 | 12011340433 |
11 | 51040a7934 |
12 | 23b26a7241 |
13 | 1195605541 |
14 | 81d330921 |
15 | 4a4760a3d |
hex | 2cbee8291 |
12011340433 has 2 divisors, whose sum is σ = 12011340434. Its totient is φ = 12011340432.
The previous prime is 12011340431. The next prime is 12011340449. The reversal of 12011340433 is 33404311021.
12011340433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7151577489 + 4859762944 = 84567^2 + 69712^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011340433 - 21 = 12011340431 is a prime.
Together with 12011340431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (12011340431) 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, 6005670216 + 6005670217.
It is an arithmetic number, because the mean of its divisors is an integer number (6005670217).
Almost surely, 212011340433 is an apocalyptic number.
It is an amenable number.
12011340433 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011340433 is an equidigital number, since it uses as much as digits as its factorization.
12011340433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12011340433 its reverse (33404311021), we get a palindrome (45415651454).
The spelling of 12011340433 in words is "twelve billion, eleven million, three hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •