Base | Representation |
---|---|
bin | 1001101001101001000011… |
… | …1001000100010100001000 |
3 | 1101120101211211201021212120 |
4 | 2122122100321010110020 |
5 | 2342322312011200404 |
6 | 34322343125411240 |
7 | 2143422321453105 |
oct | 232322071042410 |
9 | 41511754637776 |
10 | 10611000100104 |
11 | 3421110a23638 |
12 | 1234596569b20 |
13 | 5bc7c7a46ab1 |
14 | 28980a2abaac |
15 | 13603a86e9d9 |
hex | 9a690e44508 |
10611000100104 has 128 divisors (see below), whose sum is σ = 27527309568000. Its totient is φ = 3404456100864.
The previous prime is 10611000100081. The next prime is 10611000100153. The reversal of 10611000100104 is 40100100011601.
It is a super-2 number, since 2×106110001001042 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 747404334 + ... + 747418530.
It is an arithmetic number, because the mean of its divisors is an integer number (215057106000).
Almost surely, 210611000100104 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 10611000100104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13763654784000).
10611000100104 is an abundant number, since it is smaller than the sum of its proper divisors (16916309467896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10611000100104 is a wasteful number, since it uses less digits than its factorization.
10611000100104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17487 (or 17483 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10611000100104 its reverse (40100100011601), we get a palindrome (50711100111705).
The spelling of 10611000100104 in words is "ten trillion, six hundred eleven billion, one hundred thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •