Base | Representation |
---|---|
bin | 11000001000000010000010… |
… | …110001100010111010000101 |
3 | 111220200112201111021022001202 |
4 | 120020002002301202322011 |
5 | 102401411133410402001 |
6 | 1013355554445032245 |
7 | 31230560310625640 |
oct | 3010020261427205 |
9 | 456615644238052 |
10 | 106105066106501 |
11 | 308989a6733500 |
12 | ba97a57b55685 |
13 | 472888474b617 |
14 | 1c2b726810a57 |
15 | c4008260596b |
hex | 608082c62e85 |
106105066106501 has 48 divisors (see below), whose sum is σ = 141144922638720. Its totient is φ = 77807303270400.
The previous prime is 106105066106483. The next prime is 106105066106527. The reversal of 106105066106501 is 105601660501601.
It is not a de Polignac number, because 106105066106501 - 226 = 106104998997637 is a prime.
It is a super-2 number, since 2×1061050661065012 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106105066106591) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 133240130 + ... + 134034108.
It is an arithmetic number, because the mean of its divisors is an integer number (2940519221640).
Almost surely, 2106105066106501 is an apocalyptic number.
106105066106501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106105066106501 is a deficient number, since it is larger than the sum of its proper divisors (35039856532219).
106105066106501 is a wasteful number, since it uses less digits than its factorization.
106105066106501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 803306 (or 803295 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 106105066106501 in words is "one hundred six trillion, one hundred five billion, sixty-six million, one hundred six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •