Base | Representation |
---|---|
bin | 10111010111101010111110… |
… | …01000110111111110101000 |
3 | 20201221220211202222212120220 |
4 | 23223311133020313332220 |
5 | 23213442010220433400 |
6 | 301144351055450040 |
7 | 13552603624226502 |
oct | 1353653710677650 |
9 | 221856752885526 |
10 | 51390879858600 |
11 | 15413827a17137 |
12 | 591ba91826920 |
13 | 228a1a6a03479 |
14 | c99490886d72 |
15 | 5e1bdc2b07a0 |
hex | 2ebd5f237fa8 |
51390879858600 has 96 divisors (see below), whose sum is σ = 159318587675040. Its totient is φ = 13703644512000.
The previous prime is 51390879858547. The next prime is 51390879858623. The reversal of 51390879858600 is 685897809315.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 12190170 + ... + 15855030.
It is an arithmetic number, because the mean of its divisors is an integer number (1659568621615).
Almost surely, 251390879858600 is an apocalyptic number.
51390879858600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51390879858600 is an abundant number, since it is smaller than the sum of its proper divisors (107927707816440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51390879858600 is a wasteful number, since it uses less digits than its factorization.
51390879858600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3688251 (or 3688242 counting only the distinct ones).
The product of its (nonzero) digits is 130636800, while the sum is 69.
The spelling of 51390879858600 in words is "fifty-one trillion, three hundred ninety billion, eight hundred seventy-nine million, eight hundred fifty-eight thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •