Base | Representation |
---|---|
bin | 110001101100111010… |
… | …100100010011101110 |
3 | 12002202020020102002000 |
4 | 301230322210103232 |
5 | 1333243411244300 |
6 | 40303313513130 |
7 | 3566324110410 |
oct | 615472442356 |
9 | 162666212060 |
10 | 53366899950 |
11 | 206a62508a1 |
12 | a4145727a6 |
13 | 5056476810 |
14 | 28239629b0 |
15 | 15c525ec00 |
hex | c6cea44ee |
53366899950 has 192 divisors, whose sum is σ = 180991749120. Its totient is φ = 11259803520.
The previous prime is 53366899913. The next prime is 53366899951. The reversal of 53366899950 is 5999866335.
53366899950 is a `hidden beast` number, since 533 + 6 + 6 + 8 + 9 + 9 + 95 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53366899951) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 94354 + ... + 340053.
It is an arithmetic number, because the mean of its divisors is an integer number (942665360).
Almost surely, 253366899950 is an apocalyptic number.
53366899950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53366899950 is an abundant number, since it is smaller than the sum of its proper divisors (127624849170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53366899950 is a wasteful number, since it uses less digits than its factorization.
53366899950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434448 (or 434437 counting only the distinct ones).
The product of its (nonzero) digits is 47239200, while the sum is 63.
The spelling of 53366899950 in words is "fifty-three billion, three hundred sixty-six million, eight hundred ninety-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •