Base | Representation |
---|---|
bin | 111100011100111… |
… | …010100110100101 |
3 | 2121200102100201112 |
4 | 330130322212211 |
5 | 4034114304104 |
6 | 244350034405 |
7 | 34063445204 |
oct | 7434724645 |
9 | 2550370645 |
10 | 1014213029 |
11 | 480551295 |
12 | 2437a8a05 |
13 | 13217556b |
14 | 989ab23b |
15 | 5e08c86e |
hex | 3c73a9a5 |
1014213029 has 2 divisors, whose sum is σ = 1014213030. Its totient is φ = 1014213028.
The previous prime is 1014213001. The next prime is 1014213043. The reversal of 1014213029 is 9203124101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 749500129 + 264712900 = 27377^2 + 16270^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014213029 - 216 = 1014147493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1014212995 and 1014213013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1014212029) 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, 507106514 + 507106515.
It is an arithmetic number, because the mean of its divisors is an integer number (507106515).
Almost surely, 21014213029 is an apocalyptic number.
It is an amenable number.
1014213029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014213029 is an equidigital number, since it uses as much as digits as its factorization.
1014213029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 1014213029 is about 31846.7114314806. The cubic root of 1014213029 is about 1004.7154063274.
The spelling of 1014213029 in words is "one billion, fourteen million, two hundred thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •