Base | Representation |
---|---|
bin | 100100011010101110010… |
… | …1010000111111101010000 |
3 | 122201111021101201221000000 |
4 | 1020311130222013331100 |
5 | 1124001113002240402 |
6 | 14351204143130000 |
7 | 1024420211220216 |
oct | 110653452077520 |
9 | 18644241657000 |
10 | 5005191446352 |
11 | 165a7650a4a99 |
12 | 68a0585a3900 |
13 | 2a3cab7a3a06 |
14 | 134377040cb6 |
15 | 8a2e3392c1c |
hex | 48d5ca87f50 |
5005191446352 has 1120 divisors, whose sum is σ = 16642201973760. Its totient is φ = 1449575792640.
The previous prime is 5005191446347. The next prime is 5005191446393. The reversal of 5005191446352 is 2536441915005.
It is a happy number.
5005191446352 is a `hidden beast` number, since 5 + 0 + 0 + 5 + 1 + 9 + 1 + 4 + 4 + 635 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5005191446298 and 5005191446307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 13418743638 + ... + 13418744010.
Almost surely, 25005191446352 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 5005191446352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8321100986880).
5005191446352 is an abundant number, since it is smaller than the sum of its proper divisors (11637010527408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005191446352 is a wasteful number, since it uses less digits than its factorization.
5005191446352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543 (or 522 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 45.
The spelling of 5005191446352 in words is "five trillion, five billion, one hundred ninety-one million, four hundred forty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •