Base | Representation |
---|---|
bin | 110001101010000010… |
… | …1101100011101001001 |
3 | 101012020202020010221022 |
4 | 1203110011230131021 |
5 | 3221343143241310 |
6 | 120553311122225 |
7 | 10463401414313 |
oct | 1432405543511 |
9 | 335222203838 |
10 | 106637477705 |
11 | 41252092370 |
12 | 18800813375 |
13 | a095996845 |
14 | 52387b07b3 |
15 | 2b91ce4a55 |
hex | 18d416c749 |
106637477705 has 8 divisors (see below), whose sum is σ = 139598152704. Its totient is φ = 77554529200.
The previous prime is 106637477701. The next prime is 106637477707. The reversal of 106637477705 is 507774736601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106637477705 - 22 = 106637477701 is a prime.
It is a super-2 number, since 2×1066374777052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106637477701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 969431561 + ... + 969431670.
It is an arithmetic number, because the mean of its divisors is an integer number (17449769088).
Almost surely, 2106637477705 is an apocalyptic number.
It is an amenable number.
106637477705 is a deficient number, since it is larger than the sum of its proper divisors (32960674999).
106637477705 is a wasteful number, since it uses less digits than its factorization.
106637477705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1938863247.
The product of its (nonzero) digits is 5186160, while the sum is 53.
The spelling of 106637477705 in words is "one hundred six billion, six hundred thirty-seven million, four hundred seventy-seven thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •