Base | Representation |
---|---|
bin | 10100101010110001001… |
… | …110000001110111001001 |
3 | 12000210002000110022001101 |
4 | 110222301032001313021 |
5 | 141232244441440203 |
6 | 3004252121021401 |
7 | 204420444436231 |
oct | 24526116016711 |
9 | 5023060408041 |
10 | 1420312452553 |
11 | 4a8395396565 |
12 | 1ab323924861 |
13 | a3c1cc4c577 |
14 | 4ca5a1c6cc1 |
15 | 26e2b54941d |
hex | 14ab1381dc9 |
1420312452553 has 8 divisors (see below), whose sum is σ = 1428559459200. Its totient is φ = 1412084648688.
The previous prime is 1420312452547. The next prime is 1420312452569. The reversal of 1420312452553 is 3552542130241.
It is a happy number.
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 1420312452553 - 213 = 1420312444361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1420312452583) 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 in 7 ways as a sum of consecutive naturals, for example, 4652326 + ... + 4948207.
It is an arithmetic number, because the mean of its divisors is an integer number (178569932400).
Almost surely, 21420312452553 is an apocalyptic number.
It is an amenable number.
1420312452553 is a deficient number, since it is larger than the sum of its proper divisors (8247006647).
1420312452553 is an equidigital number, since it uses as much as digits as its factorization.
1420312452553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9601391.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 1420312452553 its reverse (3552542130241), we get a palindrome (4972854582794).
The spelling of 1420312452553 in words is "one trillion, four hundred twenty billion, three hundred twelve million, four hundred fifty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •