Base | Representation |
---|---|
bin | 101111011010000010… |
… | …001101101011010000 |
3 | 11212101111022201122110 |
4 | 233122002031223100 |
5 | 1313222034404043 |
6 | 35215004305320 |
7 | 3451262263020 |
oct | 573202155320 |
9 | 155344281573 |
10 | 50902653648 |
11 | 1a651248100 |
12 | 9a47242240 |
13 | 4a52a85202 |
14 | 266c57ba80 |
15 | 14cdc47b33 |
hex | bda08dad0 |
50902653648 has 480 divisors, whose sum is σ = 178740559872. Its totient is φ = 12171202560.
The previous prime is 50902653643. The next prime is 50902653661. The reversal of 50902653648 is 84635620905.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 50902653597 and 50902653606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50902653643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 32483361 + ... + 32484927.
Almost surely, 250902653648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50902653648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89370279936).
50902653648 is an abundant number, since it is smaller than the sum of its proper divisors (127837906224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50902653648 is a wasteful number, since it uses less digits than its factorization.
50902653648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1671 (or 1654 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 48.
The spelling of 50902653648 in words is "fifty billion, nine hundred two million, six hundred fifty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •