Base | Representation |
---|---|
bin | 1001101100110110010110… |
… | …1100101011001101010101 |
3 | 1101202200002112201120202002 |
4 | 2123031211230223031111 |
5 | 2344223143130143401 |
6 | 34403535430125045 |
7 | 2150413102104014 |
oct | 233154554531525 |
9 | 41680075646662 |
10 | 10666110006101 |
11 | 34425210406a0 |
12 | 12431b67b0785 |
13 | 5c4a6b346a24 |
14 | 28c35750ca7b |
15 | 1376b3b2aa6b |
hex | 9b365b2b355 |
10666110006101 has 32 divisors (see below), whose sum is σ = 12347572722048. Its totient is φ = 9105834608640.
The previous prime is 10666110006091. The next prime is 10666110006109. The reversal of 10666110006101 is 10160001166601.
It is a de Polignac number, because none of the positive numbers 2k-10666110006101 is a prime.
It is a super-3 number, since 3×106661100061013 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10666110006109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 198771191 + ... + 198824843.
It is an arithmetic number, because the mean of its divisors is an integer number (385861647564).
Almost surely, 210666110006101 is an apocalyptic number.
10666110006101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10666110006101 is a deficient number, since it is larger than the sum of its proper divisors (1681462715947).
10666110006101 is a wasteful number, since it uses less digits than its factorization.
10666110006101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56021.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 10666110006101 in words is "ten trillion, six hundred sixty-six billion, one hundred ten million, six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •