Base | Representation |
---|---|
bin | 100011100101110101011… |
… | …1110101011000001000100 |
3 | 122022122010001202202000000 |
4 | 1013023222332223001010 |
5 | 1120121011430034031 |
6 | 14223102115321300 |
7 | 1013256532101213 |
oct | 107135276530104 |
9 | 18278101682000 |
10 | 4891615080516 |
11 | 161658220933a |
12 | 67003bbb0230 |
13 | 29637b380308 |
14 | 12ca80ca107a |
15 | 873973063e6 |
hex | 472eafab044 |
4891615080516 has 336 divisors, whose sum is σ = 13250365130688. Its totient is φ = 1578713068800.
The previous prime is 4891615080497. The next prime is 4891615080601. The reversal of 4891615080516 is 6150805161984.
4891615080516 is a `hidden beast` number, since 4 + 8 + 9 + 1 + 615 + 0 + 8 + 0 + 5 + 16 = 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 111 ways as a sum of consecutive naturals, for example, 6215520675 + ... + 6215521461.
It is an arithmetic number, because the mean of its divisors is an integer number (39435610508).
Almost surely, 24891615080516 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 4891615080516, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6625182565344).
4891615080516 is an abundant number, since it is smaller than the sum of its proper divisors (8358750050172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4891615080516 is a wasteful number, since it uses less digits than its factorization.
4891615080516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374 (or 1357 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 54.
The spelling of 4891615080516 in words is "four trillion, eight hundred ninety-one billion, six hundred fifteen million, eighty thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •