Base | Representation |
---|---|
bin | 101010101001101… |
… | …1001111001001101 |
3 | 10200201221221221101 |
4 | 1111103121321031 |
5 | 10412333301112 |
6 | 354002303101 |
7 | 50315401303 |
oct | 12523317115 |
9 | 3621857841 |
10 | 1431150157 |
11 | 674935328 |
12 | 33b357a91 |
13 | 19a667118 |
14 | d8100273 |
15 | 85999757 |
hex | 554d9e4d |
1431150157 has 2 divisors, whose sum is σ = 1431150158. Its totient is φ = 1431150156.
The previous prime is 1431150143. The next prime is 1431150169. The reversal of 1431150157 is 7510511341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1423854756 + 7295401 = 37734^2 + 2701^2 .
It is a cyclic number.
It is not a de Polignac number, because 1431150157 - 219 = 1430625869 is a prime.
It is a super-2 number, since 2×14311501572 = 4096381543762249298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1431150257) 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, 715575078 + 715575079.
It is an arithmetic number, because the mean of its divisors is an integer number (715575079).
Almost surely, 21431150157 is an apocalyptic number.
It is an amenable number.
1431150157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431150157 is an equidigital number, since it uses as much as digits as its factorization.
1431150157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2100, while the sum is 28.
The square root of 1431150157 is about 37830.5452908096. The cubic root of 1431150157 is about 1126.9251401638.
Adding to 1431150157 its reverse (7510511341), we get a palindrome (8941661498).
The spelling of 1431150157 in words is "one billion, four hundred thirty-one million, one hundred fifty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •