Base | Representation |
---|---|
bin | 1001101101101110001010… |
… | …1110111111111000000000 |
3 | 1101211002202201020201022010 |
4 | 2123123202232333320000 |
5 | 2344444334210401203 |
6 | 34414454244412520 |
7 | 2151453301454523 |
oct | 233334256777000 |
9 | 41732681221263 |
10 | 10681092668928 |
11 | 344890a3a0a70 |
12 | 12460983a7140 |
13 | 5c62b84026a6 |
14 | 28cd792dcbba |
15 | 137c8e168303 |
hex | 9b6e2bbfe00 |
10681092668928 has 160 divisors (see below), whose sum is σ = 31046442400512. Its totient is φ = 3236223795200.
The previous prime is 10681092668891. The next prime is 10681092668933. The reversal of 10681092668928 is 82986629018601.
It is a super-2 number, since 2×106810926689282 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126356725 + ... + 126441227.
Almost surely, 210681092668928 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 10681092668928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15523221200256).
10681092668928 is an abundant number, since it is smaller than the sum of its proper divisors (20365349731584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10681092668928 is an equidigital number, since it uses as much as digits as its factorization.
10681092668928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92016 (or 92000 counting only the distinct ones).
The product of its (nonzero) digits is 35831808, while the sum is 66.
The spelling of 10681092668928 in words is "ten trillion, six hundred eighty-one billion, ninety-two million, six hundred sixty-eight thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •