Base | Representation |
---|---|
bin | 101010111011100… |
… | …0110101111110001 |
3 | 10201101120102201222 |
4 | 1111313012233301 |
5 | 10422232241123 |
6 | 354535034425 |
7 | 50461060304 |
oct | 12567065761 |
9 | 3641512658 |
10 | 1440508913 |
11 | 67a147738 |
12 | 34250ba15 |
13 | 19c592b4c |
14 | d9458b3b |
15 | 866e76c8 |
hex | 55dc6bf1 |
1440508913 has 2 divisors, whose sum is σ = 1440508914. Its totient is φ = 1440508912.
The previous prime is 1440508873. The next prime is 1440508919. The reversal of 1440508913 is 3198050441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1246937344 + 193571569 = 35312^2 + 13913^2 .
It is an emirp because it is prime and its reverse (3198050441) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1440508913 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1440508919) 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, 720254456 + 720254457.
It is an arithmetic number, because the mean of its divisors is an integer number (720254457).
Almost surely, 21440508913 is an apocalyptic number.
It is an amenable number.
1440508913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440508913 is an equidigital number, since it uses as much as digits as its factorization.
1440508913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
The square root of 1440508913 is about 37954.0368472182. The cubic root of 1440508913 is about 1129.3762482858.
The spelling of 1440508913 in words is "one billion, four hundred forty million, five hundred eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •