Base | Representation |
---|---|
bin | 10111001011000000… |
… | …10111110001010101 |
3 | 1012002222210221201202 |
4 | 23211200113301111 |
5 | 200434220344104 |
6 | 5414241002245 |
7 | 620166452405 |
oct | 134540276125 |
9 | 35088727652 |
10 | 12440403029 |
11 | 5304312a1a |
12 | 24b2323385 |
13 | 1233481232 |
14 | 8602dc805 |
15 | 4cc26551e |
hex | 2e5817c55 |
12440403029 has 2 divisors, whose sum is σ = 12440403030. Its totient is φ = 12440403028.
The previous prime is 12440403011. The next prime is 12440403077. The reversal of 12440403029 is 92030404421.
12440403029 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., 10415223025 + 2025180004 = 102055^2 + 45002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12440403029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12440402992 and 12440403010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12440403929) 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, 6220201514 + 6220201515.
It is an arithmetic number, because the mean of its divisors is an integer number (6220201515).
Almost surely, 212440403029 is an apocalyptic number.
It is an amenable number.
12440403029 is a deficient number, since it is larger than the sum of its proper divisors (1).
12440403029 is an equidigital number, since it uses as much as digits as its factorization.
12440403029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 12440403029 in words is "twelve billion, four hundred forty million, four hundred three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •