Base | Representation |
---|---|
bin | 11110101110011101000… |
… | …100010110100110110000 |
3 | 21110212001120020010202201 |
4 | 132232131010112212300 |
5 | 234043234302401131 |
6 | 4253554311352544 |
7 | 305356022530240 |
oct | 36563504264660 |
9 | 7425046203681 |
10 | 2111464106416 |
11 | 7445154957a5 |
12 | 2a1271082754 |
13 | 124158196b22 |
14 | 742a42b1b20 |
15 | 39dcd8ce761 |
hex | 1eb9d1169b0 |
2111464106416 has 80 divisors (see below), whose sum is σ = 4746521203200. Its totient is φ = 891152570880.
The previous prime is 2111464106399. The next prime is 2111464106417. The reversal of 2111464106416 is 6146014641112.
It is not an unprimeable number, because it can be changed into a prime (2111464106417) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27508860 + ... + 27585508.
It is an arithmetic number, because the mean of its divisors is an integer number (59331515040).
Almost surely, 22111464106416 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 2111464106416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2373260601600).
2111464106416 is an abundant number, since it is smaller than the sum of its proper divisors (2635057096784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111464106416 is a wasteful number, since it uses less digits than its factorization.
2111464106416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80402 (or 80396 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
Adding to 2111464106416 its reverse (6146014641112), we get a palindrome (8257478747528).
The spelling of 2111464106416 in words is "two trillion, one hundred eleven billion, four hundred sixty-four million, one hundred six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •