Base | Representation |
---|---|
bin | 100100111111001000000… |
… | …0110000100010100001000 |
3 | 122222222001100212000002000 |
4 | 1021332100012010110020 |
5 | 1131241212114231213 |
6 | 14451133132311000 |
7 | 1033155331355400 |
oct | 111762006042410 |
9 | 18888040760060 |
10 | 5083363820808 |
11 | 168a92a398a39 |
12 | 6a1234312460 |
13 | 2ab4890954a0 |
14 | 138071191800 |
15 | 8c36b19cc73 |
hex | 49f90184508 |
5083363820808 has 1536 divisors, whose sum is σ = 19877477760000. Its totient is φ = 1186391162880.
The previous prime is 5083363820771. The next prime is 5083363820819. The reversal of 5083363820808 is 8080283633805.
5083363820808 is a `hidden beast` number, since 50 + 83 + 363 + 82 + 0 + 80 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 3281706018 + ... + 3281707566.
It is an arithmetic number, because the mean of its divisors is an integer number (12941066250).
Almost surely, 25083363820808 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 5083363820808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9938738880000).
5083363820808 is an abundant number, since it is smaller than the sum of its proper divisors (14794113939192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5083363820808 is a wasteful number, since it uses less digits than its factorization.
5083363820808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1692 (or 1675 counting only the distinct ones).
The product of its (nonzero) digits is 6635520, while the sum is 54.
The spelling of 5083363820808 in words is "five trillion, eighty-three billion, three hundred sixty-three million, eight hundred twenty thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •