Base | Representation |
---|---|
bin | 101010111011001… |
… | …0110101011001101 |
3 | 10201101012102122101 |
4 | 1111312112223031 |
5 | 10422204441023 |
6 | 354530515101 |
7 | 50456310250 |
oct | 12566265315 |
9 | 3641172571 |
10 | 1440312013 |
11 | 67a022808 |
12 | 342435a91 |
13 | 19c52433a |
14 | d9407097 |
15 | 866a91ad |
hex | 55d96acd |
1440312013 has 4 divisors (see below), whose sum is σ = 1646070880. Its totient is φ = 1234553148.
The previous prime is 1440312011. The next prime is 1440312017. The reversal of 1440312013 is 3102130441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1440312013 - 21 = 1440312011 is a prime.
It is a super-2 number, since 2×14403120132 = 4148997389584224338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1440312011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102879423 + ... + 102879436.
It is an arithmetic number, because the mean of its divisors is an integer number (411517720).
Almost surely, 21440312013 is an apocalyptic number.
It is an amenable number.
1440312013 is a deficient number, since it is larger than the sum of its proper divisors (205758867).
1440312013 is an equidigital number, since it uses as much as digits as its factorization.
1440312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205758866.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1440312013 is about 37951.4428315973. The cubic root of 1440312013 is about 1129.3247886213.
Adding to 1440312013 its reverse (3102130441), we get a palindrome (4542442454).
The spelling of 1440312013 in words is "one billion, four hundred forty million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •