Base | Representation |
---|---|
bin | 111110101101110… |
… | …101000111010101 |
3 | 2201022220101000022 |
4 | 332231311013111 |
5 | 4123330421204 |
6 | 252224154525 |
7 | 35034364436 |
oct | 7655650725 |
9 | 2638811008 |
10 | 1052201429 |
11 | 49aa38564 |
12 | 254468a45 |
13 | 139cb65c6 |
14 | 9da5948d |
15 | 625935be |
hex | 3eb751d5 |
1052201429 has 2 divisors, whose sum is σ = 1052201430. Its totient is φ = 1052201428.
The previous prime is 1052201393. The next prime is 1052201441. The reversal of 1052201429 is 9241022501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1025472529 + 26728900 = 32023^2 + 5170^2 .
It is a cyclic number.
It is not a de Polignac number, because 1052201429 - 220 = 1051152853 is a prime.
It is a super-2 number, since 2×10522014292 = 2214255694379284082, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1052201398 and 1052201407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1052201459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526100714 + 526100715.
It is an arithmetic number, because the mean of its divisors is an integer number (526100715).
Almost surely, 21052201429 is an apocalyptic number.
It is an amenable number.
1052201429 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052201429 is an equidigital number, since it uses as much as digits as its factorization.
1052201429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 1052201429 is about 32437.6544928884. The cubic root of 1052201429 is about 1017.1061861811.
The spelling of 1052201429 in words is "one billion, fifty-two million, two hundred one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •