Base | Representation |
---|---|
bin | 10111001010010010… |
… | …01011001001011011 |
3 | 1012002120101000010212 |
4 | 23211021023021123 |
5 | 200431141301021 |
6 | 5413502401335 |
7 | 620063664446 |
oct | 134511131133 |
9 | 35076330125 |
10 | 12434322011 |
11 | 530093a191 |
12 | 24b029024b |
13 | 12321323b7 |
14 | 85d59865d |
15 | 4cb96385b |
hex | 2e524b25b |
12434322011 has 2 divisors, whose sum is σ = 12434322012. Its totient is φ = 12434322010.
The previous prime is 12434322001. The next prime is 12434322049. The reversal of 12434322011 is 11022343421.
12434322011 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 is an emirp because it is prime and its reverse (11022343421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12434322011 - 26 = 12434321947 is a prime.
It is a super-2 number, since 2×124343220112 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12434322001) 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, 6217161005 + 6217161006.
It is an arithmetic number, because the mean of its divisors is an integer number (6217161006).
Almost surely, 212434322011 is an apocalyptic number.
12434322011 is a deficient number, since it is larger than the sum of its proper divisors (1).
12434322011 is an equidigital number, since it uses as much as digits as its factorization.
12434322011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12434322011 its reverse (11022343421), we get a palindrome (23456665432).
The spelling of 12434322011 in words is "twelve billion, four hundred thirty-four million, three hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •