Base | Representation |
---|---|
bin | 111101001000010… |
… | …111111000001001 |
3 | 2122110212010202011 |
4 | 331020113320021 |
5 | 4100023331004 |
6 | 245434135521 |
7 | 34262333263 |
oct | 7510277011 |
9 | 2573763664 |
10 | 1025605129 |
11 | 486a2234a |
12 | 2475815a1 |
13 | 134633953 |
14 | 9a2d4b33 |
15 | 6008d004 |
hex | 3d217e09 |
1025605129 has 2 divisors, whose sum is σ = 1025605130. Its totient is φ = 1025605128.
The previous prime is 1025605111. The next prime is 1025605151. The reversal of 1025605129 is 9215065201.
1025605129 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., 969699600 + 55905529 = 31140^2 + 7477^2 .
It is a cyclic number.
It is not a de Polignac number, because 1025605129 - 213 = 1025596937 is a prime.
It is a super-2 number, since 2×10256051292 = 2103731761262213282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1025605129.
It is not a weakly prime, because it can be changed into another prime (1025600129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 512802564 + 512802565.
It is an arithmetic number, because the mean of its divisors is an integer number (512802565).
Almost surely, 21025605129 is an apocalyptic number.
It is an amenable number.
1025605129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1025605129 is an equidigital number, since it uses as much as digits as its factorization.
1025605129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 1025605129 is about 32025.0703199852. The cubic root of 1025605129 is about 1008.4632149309.
The spelling of 1025605129 in words is "one billion, twenty-five million, six hundred five thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •