Base | Representation |
---|---|
bin | 1001110101100100111101… |
… | …1001000110100000000000 |
3 | 1102022000010210101210210222 |
4 | 2131121033121012200000 |
5 | 2404202242231202431 |
6 | 35000455035042212 |
7 | 2164302016640621 |
oct | 235311731064000 |
9 | 42260123353728 |
10 | 10816059631616 |
11 | 34a0079762738 |
12 | 12682845a0368 |
13 | 605c473394a5 |
14 | 295700309a48 |
15 | 13b53d0a957b |
hex | 9d64f646800 |
10816059631616 has 96 divisors (see below), whose sum is σ = 22430152017000. Its totient is φ = 5208111906816.
The previous prime is 10816059631579. The next prime is 10816059631627. The reversal of 10816059631616 is 61613695061801.
It can be written as a sum of positive squares in 4 ways, for example, as 4432877593600 + 6383182038016 = 2105440^2 + 2526496^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22869410 + ... + 23337566.
Almost surely, 210816059631616 is an apocalyptic number.
10816059631616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10816059631616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11215076008500).
10816059631616 is an abundant number, since it is smaller than the sum of its proper divisors (11614092385384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10816059631616 is an equidigital number, since it uses as much as digits as its factorization.
10816059631616 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468597 (or 468577 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 53.
The spelling of 10816059631616 in words is "ten trillion, eight hundred sixteen billion, fifty-nine million, six hundred thirty-one thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •