Base | Representation |
---|---|
bin | 10111010101110001111100… |
… | …10110111111000011110101 |
3 | 20201201201010121002101120020 |
4 | 23222320332112333003311 |
5 | 23211410423240300203 |
6 | 301054443451355353 |
7 | 13545113532363264 |
oct | 1352707626770365 |
9 | 221651117071506 |
10 | 51325905400053 |
11 | 15399215597809 |
12 | 590b379a52b59 |
13 | 22840207bb1ab |
14 | c962894a05db |
15 | 5e0187e9e153 |
hex | 2eae3e5bf0f5 |
51325905400053 has 8 divisors (see below), whose sum is σ = 69074115679008. Its totient is φ = 33897482693904.
The previous prime is 51325905400001. The next prime is 51325905400087. The reversal of 51325905400053 is 35000450952315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51325905400053 - 29 = 51325905399541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51325905399978 and 51325905400014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51325905400093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79946892826 + ... + 79946893467.
It is an arithmetic number, because the mean of its divisors is an integer number (8634264459876).
Almost surely, 251325905400053 is an apocalyptic number.
It is an amenable number.
51325905400053 is a deficient number, since it is larger than the sum of its proper divisors (17748210278955).
51325905400053 is a wasteful number, since it uses less digits than its factorization.
51325905400053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159893786403.
The product of its (nonzero) digits is 405000, while the sum is 42.
The spelling of 51325905400053 in words is "fifty-one trillion, three hundred twenty-five billion, nine hundred five million, four hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •