Base | Representation |
---|---|
bin | 100101000010111101001… |
… | …1101011010110011000000 |
3 | 200000202021201022201210000 |
4 | 1022011322131122303000 |
5 | 1131410034214344143 |
6 | 14455013340440000 |
7 | 1033566236346435 |
oct | 112057235326300 |
9 | 20022251281700 |
10 | 5091590778048 |
11 | 1693371290755 |
12 | 6a294b549000 |
13 | 2ac19a640918 |
14 | 138611a57b8c |
15 | 8c69d579bd3 |
hex | 4a17a75acc0 |
5091590778048 has 280 divisors, whose sum is σ = 15959962617984. Its totient is φ = 1602386841600.
The previous prime is 5091590778041. The next prime is 5091590778059. The reversal of 5091590778048 is 8408770951905.
5091590778048 is a `hidden beast` number, since 509 + 1 + 5 + 9 + 0 + 7 + 7 + 80 + 48 = 666.
It is a super-2 number, since 2×50915907780482 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5091590778041) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6202486 + ... + 6975242.
Almost surely, 25091590778048 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 5091590778048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7979981308992).
5091590778048 is an abundant number, since it is smaller than the sum of its proper divisors (10868371839936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5091590778048 is a wasteful number, since it uses less digits than its factorization.
5091590778048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 772853 (or 772834 counting only the distinct ones).
The product of its (nonzero) digits is 25401600, while the sum is 63.
The spelling of 5091590778048 in words is "five trillion, ninety-one billion, five hundred ninety million, seven hundred seventy-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •