Base | Representation |
---|---|
bin | 10100111101011001110… |
… | …011001101100010000101 |
3 | 12002200201102101120221202 |
4 | 110331121303031202011 |
5 | 142044234041004112 |
6 | 3021401341552245 |
7 | 206026326306506 |
oct | 24753163154205 |
9 | 5080642346852 |
10 | 1440320641157 |
11 | 5059224a8822 |
12 | 1b3188575685 |
13 | a5a8b233418 |
14 | 4d9d7600bad |
15 | 276ecd816c2 |
hex | 14f59ccd885 |
1440320641157 has 8 divisors (see below), whose sum is σ = 1446026186880. Its totient is φ = 1434616831120.
The previous prime is 1440320641103. The next prime is 1440320641213. The reversal of 1440320641157 is 7511460230441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1440320641157 - 218 = 1440320379013 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1440320641157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1440380641157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1241807 + ... + 2103027.
It is an arithmetic number, because the mean of its divisors is an integer number (180753273360).
Almost surely, 21440320641157 is an apocalyptic number.
It is an amenable number.
1440320641157 is a deficient number, since it is larger than the sum of its proper divisors (5705545723).
1440320641157 is an equidigital number, since it uses as much as digits as its factorization.
1440320641157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867843.
The product of its (nonzero) digits is 80640, while the sum is 38.
Adding to 1440320641157 its reverse (7511460230441), we get a palindrome (8951780871598).
The spelling of 1440320641157 in words is "one trillion, four hundred forty billion, three hundred twenty million, six hundred forty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •