Base | Representation |
---|---|
bin | 1001101100101101000100… |
… | …1010100110110101001010 |
3 | 1101202102122212122221220220 |
4 | 2123023101022212311022 |
5 | 2344203042210003211 |
6 | 34402444250530510 |
7 | 2150264252566020 |
oct | 233132112466512 |
9 | 41672585587826 |
10 | 10663618047306 |
11 | 344146242a114 |
12 | 1242820136a36 |
13 | 5c4761ca16b3 |
14 | 28c19c592710 |
15 | 1375b9e8c806 |
hex | 9b2d12a6d4a |
10663618047306 has 128 divisors (see below), whose sum is σ = 25075071590400. Its totient is φ = 2960572032000.
The previous prime is 10663618047289. The next prime is 10663618047307. The reversal of 10663618047306 is 60374081636601.
It is a happy number.
It is a super-2 number, since 2×106636180473062 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10663618047307) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 76952770 + ... + 77091218.
It is an arithmetic number, because the mean of its divisors is an integer number (195898996800).
Almost surely, 210663618047306 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10663618047306, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12537535795200).
10663618047306 is an abundant number, since it is smaller than the sum of its proper divisors (14411453543094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10663618047306 is a wasteful number, since it uses less digits than its factorization.
10663618047306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138900.
The product of its (nonzero) digits is 2612736, while the sum is 51.
The spelling of 10663618047306 in words is "ten trillion, six hundred sixty-three billion, six hundred eighteen million, forty-seven thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •