Base | Representation |
---|---|
bin | 10111001000101110… |
… | …01010001110010101 |
3 | 1012001122200220020221 |
4 | 23210113022032111 |
5 | 200414312223104 |
6 | 5412313354341 |
7 | 616544360143 |
oct | 134427121625 |
9 | 35048626227 |
10 | 12421211029 |
11 | 52a44a4767 |
12 | 24a7a089b1 |
13 | 122c4c1816 |
14 | 85b944593 |
15 | 4ca723c54 |
hex | 2e45ca395 |
12421211029 has 2 divisors, whose sum is σ = 12421211030. Its totient is φ = 12421211028.
The previous prime is 12421211021. The next prime is 12421211053. The reversal of 12421211029 is 92011212421.
12421211029 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., 11421196900 + 1000014129 = 106870^2 + 31623^2 .
It is a cyclic number.
It is not a de Polignac number, because 12421211029 - 23 = 12421211021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12421210994 and 12421211012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12421211021) 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, 6210605514 + 6210605515.
It is an arithmetic number, because the mean of its divisors is an integer number (6210605515).
Almost surely, 212421211029 is an apocalyptic number.
It is an amenable number.
12421211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
12421211029 is an equidigital number, since it uses as much as digits as its factorization.
12421211029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 12421211029 in words is "twelve billion, four hundred twenty-one million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •