Base | Representation |
---|---|
bin | 10111010101111011100010… |
… | …11000111011011001000001 |
3 | 20201202012102120211010100102 |
4 | 23222331301120323121001 |
5 | 23212002000431432000 |
6 | 301101054541532145 |
7 | 13545355301212106 |
oct | 1352756130733101 |
9 | 221665376733312 |
10 | 51331056514625 |
11 | 153a0419228398 |
12 | 5910376b74055 |
13 | 2284661a49094 |
14 | c9661765aaad |
15 | 5e038a3053d5 |
hex | 2eaf7163b641 |
51331056514625 has 32 divisors (see below), whose sum is σ = 67899319967232. Its totient is φ = 38609460960000.
The previous prime is 51331056514579. The next prime is 51331056514669. The reversal of 51331056514625 is 52641565013315.
It is not a de Polignac number, because 51331056514625 - 210 = 51331056513601 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 51331056514625.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10375241 + ... + 14501990.
It is an arithmetic number, because the mean of its divisors is an integer number (2121853748976).
Almost surely, 251331056514625 is an apocalyptic number.
It is an amenable number.
51331056514625 is a deficient number, since it is larger than the sum of its proper divisors (16568263452607).
51331056514625 is a wasteful number, since it uses less digits than its factorization.
51331056514625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24878234 (or 24878224 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 47.
The spelling of 51331056514625 in words is "fifty-one trillion, three hundred thirty-one billion, fifty-six million, five hundred fourteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •