Base | Representation |
---|---|
bin | 10111011001111011001000… |
… | …01111011110000001001000 |
3 | 20202020022121120101120011022 |
4 | 23230331210033132001020 |
5 | 23221224011332302210 |
6 | 301244110555452012 |
7 | 13561313555133113 |
oct | 1354754417360110 |
9 | 222208546346138 |
10 | 51468274884680 |
11 | 15443633440805 |
12 | 5932a91157008 |
13 | 229458c2433a4 |
14 | c9d11368757a |
15 | 5e3c1bc1a155 |
hex | 2ecf643de048 |
51468274884680 has 64 divisors (see below), whose sum is σ = 116151980244480. Its totient is φ = 20525431680000.
The previous prime is 51468274884629. The next prime is 51468274884683. The reversal of 51468274884680 is 8648847286415.
51468274884680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (51468274884683) 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 in 15 ways as a sum of consecutive naturals, for example, 30471707 + ... + 32116373.
It is an arithmetic number, because the mean of its divisors is an integer number (1814874691320).
Almost surely, 251468274884680 is an apocalyptic number.
It is an amenable number.
51468274884680 is an abundant number, since it is smaller than the sum of its proper divisors (64683705359800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51468274884680 is a wasteful number, since it uses less digits than its factorization.
51468274884680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647030 (or 1647026 counting only the distinct ones).
The product of its (nonzero) digits is 660602880, while the sum is 71.
The spelling of 51468274884680 in words is "fifty-one trillion, four hundred sixty-eight billion, two hundred seventy-four million, eight hundred eighty-four thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •