Base | Representation |
---|---|
bin | 100100100111110111111… |
… | …110010000111001101000 |
3 | 22220121002021110121111022 |
4 | 210213313332100321220 |
5 | 312213213314201124 |
6 | 5204055145352012 |
7 | 346553400263504 |
oct | 44476776207150 |
9 | 8817067417438 |
10 | 2516716162664 |
11 | 890373732750 |
12 | 34790b198608 |
13 | 15342c946352 |
14 | 89b49bc9304 |
15 | 456eb41cc5e |
hex | 249f7f90e68 |
2516716162664 has 128 divisors (see below), whose sum is σ = 5385222144000. Its totient is φ = 1092219897600.
The previous prime is 2516716162661. The next prime is 2516716162669. The reversal of 2516716162664 is 4662616176152.
It is not an unprimeable number, because it can be changed into a prime (2516716162661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 348910322 + ... + 348917534.
It is an arithmetic number, because the mean of its divisors is an integer number (42072048000).
Almost surely, 22516716162664 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 2516716162664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2692611072000).
2516716162664 is an abundant number, since it is smaller than the sum of its proper divisors (2868505981336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2516716162664 is a wasteful number, since it uses less digits than its factorization.
2516716162664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8959 (or 8955 counting only the distinct ones).
The product of its digits is 4354560, while the sum is 53.
The spelling of 2516716162664 in words is "two trillion, five hundred sixteen billion, seven hundred sixteen million, one hundred sixty-two thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •