Base | Representation |
---|---|
bin | 10100111101000110111… |
… | …101110100001110110001 |
3 | 12002122220101210210001202 |
4 | 110331012331310032301 |
5 | 142043112142412001 |
6 | 3021310133140545 |
7 | 206015441413244 |
oct | 24750675641661 |
9 | 5078811723052 |
10 | 1440004654001 |
11 | 5057800a4a11 |
12 | 1b30ba78a755 |
13 | a5a3a928884 |
14 | 4d9a766925b |
15 | 276d026596b |
hex | 14f46f743b1 |
1440004654001 has 2 divisors, whose sum is σ = 1440004654002. Its totient is φ = 1440004654000.
The previous prime is 1440004653991. The next prime is 1440004654031. The reversal of 1440004654001 is 1004564000441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1285103373376 + 154901280625 = 1133624^2 + 393575^2 .
It is a cyclic number.
It is not a de Polignac number, because 1440004654001 - 218 = 1440004391857 is a prime.
It is a super-2 number, since 2×14400046540012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1440004654031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 720002327000 + 720002327001.
It is an arithmetic number, because the mean of its divisors is an integer number (720002327001).
Almost surely, 21440004654001 is an apocalyptic number.
It is an amenable number.
1440004654001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440004654001 is an equidigital number, since it uses as much as digits as its factorization.
1440004654001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 1440004654001 its reverse (1004564000441), we get a palindrome (2444568654442).
The spelling of 1440004654001 in words is "one trillion, four hundred forty billion, four million, six hundred fifty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •