Base | Representation |
---|---|
bin | 101010101001011… |
… | …1011010111101001 |
3 | 10200201201121102201 |
4 | 1111102323113221 |
5 | 10412320301004 |
6 | 353555500201 |
7 | 50314340632 |
oct | 12522732751 |
9 | 3621647381 |
10 | 1431025129 |
11 | 67485a3a6 |
12 | 33b2b7661 |
13 | 19a622241 |
14 | d80aa889 |
15 | 859726a4 |
hex | 554bb5e9 |
1431025129 has 2 divisors, whose sum is σ = 1431025130. Its totient is φ = 1431025128.
The previous prime is 1431025111. The next prime is 1431025157. The reversal of 1431025129 is 9215201341.
It is an a-pointer prime, because the next prime (1431025157) can be obtained adding 1431025129 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1348578729 + 82446400 = 36723^2 + 9080^2 .
It is an emirp because it is prime and its reverse (9215201341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1431025129 - 211 = 1431023081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1431025097 and 1431025106.
It is not a weakly prime, because it can be changed into another prime (1431025159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 715512564 + 715512565.
It is an arithmetic number, because the mean of its divisors is an integer number (715512565).
Almost surely, 21431025129 is an apocalyptic number.
It is an amenable number.
1431025129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431025129 is an equidigital number, since it uses as much as digits as its factorization.
1431025129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 1431025129 is about 37828.8927805190. The cubic root of 1431025129 is about 1126.8923224335.
The spelling of 1431025129 in words is "one billion, four hundred thirty-one million, twenty-five thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •