Base | Representation |
---|---|
bin | 100100111101111110100… |
… | …0000110100000101010000 |
3 | 122222201200101120111212212 |
4 | 1021323331000310011100 |
5 | 1131221133411132343 |
6 | 14450044222411252 |
7 | 1033040226024650 |
oct | 111737500640520 |
9 | 18881611514785 |
10 | 5080896192848 |
11 | 1689883495593 |
12 | 6a0865a30b28 |
13 | 2ab184a8b8b8 |
14 | 137cb956a360 |
15 | 8c274718c18 |
hex | 49efd034150 |
5080896192848 has 20 divisors (see below), whose sum is σ = 11250555855840. Its totient is φ = 2177526939744.
The previous prime is 5080896192809. The next prime is 5080896192857. The reversal of 5080896192848 is 8482916980805.
It is a super-2 number, since 2×50808961928482 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
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 3 ways as a sum of consecutive naturals, for example, 22682572178 + ... + 22682572401.
It is an arithmetic number, because the mean of its divisors is an integer number (562527792792).
Almost surely, 25080896192848 is an apocalyptic number.
It is an amenable number.
5080896192848 is an abundant number, since it is smaller than the sum of its proper divisors (6169659662992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5080896192848 is a wasteful number, since it uses less digits than its factorization.
5080896192848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45365144594 (or 45365144588 counting only the distinct ones).
The product of its (nonzero) digits is 79626240, while the sum is 68.
The spelling of 5080896192848 in words is "five trillion, eighty billion, eight hundred ninety-six million, one hundred ninety-two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •