Base | Representation |
---|---|
bin | 100100110000010011010… |
… | …0000110001101101110110 |
3 | 122212220212122111210120122 |
4 | 1021200212200301231312 |
5 | 1130231012040312200 |
6 | 14424350105131542 |
7 | 1030650364462211 |
oct | 111404640615566 |
9 | 18786778453518 |
10 | 5051527666550 |
11 | 1678382747052 |
12 | 69702a489bb2 |
13 | 2a84844920a1 |
14 | 1366d0d3c778 |
15 | 8b606278385 |
hex | 49826831b76 |
5051527666550 has 24 divisors (see below), whose sum is σ = 9406434373776. Its totient is φ = 2018333020640.
The previous prime is 5051527666541. The next prime is 5051527666561. The reversal of 5051527666550 is 556667251505.
It is a hoax number, since the sum of its digits (53) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5051527666492 and 5051527666501.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56906357 + ... + 56995056.
It is an arithmetic number, because the mean of its divisors is an integer number (391934765574).
Almost surely, 25051527666550 is an apocalyptic number.
5051527666550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5051527666550 is a deficient number, since it is larger than the sum of its proper divisors (4354906707226).
5051527666550 is a wasteful number, since it uses less digits than its factorization.
5051527666550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113902312 (or 113902307 counting only the distinct ones).
The product of its (nonzero) digits is 9450000, while the sum is 53.
The spelling of 5051527666550 in words is "five trillion, fifty-one billion, five hundred twenty-seven million, six hundred sixty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •