Base | Representation |
---|---|
bin | 10111011100011001110010… |
… | …10101001001111101100111 |
3 | 20202112110110212111020200111 |
4 | 23232030321111021331213 |
5 | 23224122433300113111 |
6 | 301351155134153451 |
7 | 13600420441206664 |
oct | 1356147125117547 |
9 | 222473425436614 |
10 | 51553454301031 |
11 | 15476773a58a71 |
12 | 59474a3652887 |
13 | 229c6154350b7 |
14 | ca32b4268a6b |
15 | 5e6054c80a21 |
hex | 2ee339549f67 |
51553454301031 has 8 divisors (see below), whose sum is σ = 51615053328384. Its totient is φ = 51491862548280.
The previous prime is 51553454301023. The next prime is 51553454301061. The reversal of 51553454301031 is 13010345435515.
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 51553454301031 - 23 = 51553454301023 is a prime.
It is a super-2 number, since 2×515534543010312 (a number of 28 digits) 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 (51553454301061) 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, 12429996 + ... + 16050286.
It is an arithmetic number, because the mean of its divisors is an integer number (6451881666048).
Almost surely, 251553454301031 is an apocalyptic number.
51553454301031 is a deficient number, since it is larger than the sum of its proper divisors (61599027353).
51553454301031 is a wasteful number, since it uses less digits than its factorization.
51553454301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3637301.
The product of its (nonzero) digits is 270000, while the sum is 40.
Adding to 51553454301031 its reverse (13010345435515), we get a palindrome (64563799736546).
The spelling of 51553454301031 in words is "fifty-one trillion, five hundred fifty-three billion, four hundred fifty-four million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •