Base | Representation |
---|---|
bin | 10100111101011010011… |
… | …010101111000010010001 |
3 | 12002200202010212222100201 |
4 | 110331122122233002101 |
5 | 142044244214031001 |
6 | 3021402352015201 |
7 | 206026513341163 |
oct | 24753232570221 |
9 | 5080663788321 |
10 | 1440331002001 |
11 | 505928335001 |
12 | 1b318bb31501 |
13 | a5a904202b8 |
14 | 4d9d8b3a933 |
15 | 276edc2b501 |
hex | 14f5a6af091 |
1440331002001 has 2 divisors, whose sum is σ = 1440331002002. Its totient is φ = 1440331002000.
The previous prime is 1440331001939. The next prime is 1440331002023. The reversal of 1440331002001 is 1002001330441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1232490750976 + 207840251025 = 1110176^2 + 455895^2 .
It is an emirp because it is prime and its reverse (1002001330441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1440331002001 - 223 = 1440322613393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1440331002001.
It is not a weakly prime, because it can be changed into another prime (1440331000001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 720165501000 + 720165501001.
It is an arithmetic number, because the mean of its divisors is an integer number (720165501001).
Almost surely, 21440331002001 is an apocalyptic number.
It is an amenable number.
1440331002001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440331002001 is an equidigital number, since it uses as much as digits as its factorization.
1440331002001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1440331002001 its reverse (1002001330441), we get a palindrome (2442332332442).
The spelling of 1440331002001 in words is "one trillion, four hundred forty billion, three hundred thirty-one million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •