Base | Representation |
---|---|
bin | 101010111011110… |
… | …1010111011101011 |
3 | 10201101211222001112 |
4 | 1111313222323223 |
5 | 10422302012011 |
6 | 354542140535 |
7 | 50462245364 |
oct | 12567527353 |
9 | 3641758045 |
10 | 1440657131 |
11 | 67a239031 |
12 | 34258174b |
13 | 19c615454 |
14 | d9496b6b |
15 | 8672658b |
hex | 55deaeeb |
1440657131 has 2 divisors, whose sum is σ = 1440657132. Its totient is φ = 1440657130.
The previous prime is 1440657073. The next prime is 1440657133. The reversal of 1440657131 is 1317560441.
It is a strong prime.
It is an emirp because it is prime and its reverse (1317560441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1440657131 - 26 = 1440657067 is a prime.
It is a super-2 number, since 2×14406571312 = 4150985938202302322, which contains 22 as substring.
Together with 1440657133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1440657133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 720328565 + 720328566.
It is an arithmetic number, because the mean of its divisors is an integer number (720328566).
Almost surely, 21440657131 is an apocalyptic number.
1440657131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440657131 is an equidigital number, since it uses as much as digits as its factorization.
1440657131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 32.
The square root of 1440657131 is about 37955.9893956145. The cubic root of 1440657131 is about 1129.4149818533.
The spelling of 1440657131 in words is "one billion, four hundred forty million, six hundred fifty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •