Base | Representation |
---|---|
bin | 110001101001000101… |
… | …1011000111100100111 |
3 | 101012011111220020212022 |
4 | 1203102023120330213 |
5 | 3221311441304411 |
6 | 120550204013355 |
7 | 10462532041526 |
oct | 1432213307447 |
9 | 335144806768 |
10 | 106605416231 |
11 | 41235a84086 |
12 | 187b1b3125b |
13 | a08c14c462 |
14 | 52344264bd |
15 | 2b8e0aeedb |
hex | 18d22d8f27 |
106605416231 has 8 divisors (see below), whose sum is σ = 111293481600. Its totient is φ = 101921771512.
The previous prime is 106605416171. The next prime is 106605416237. The reversal of 106605416231 is 132614506601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106605416231 - 26 = 106605416167 is a prime.
It is a super-2 number, since 2×1066054162312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106605416191 and 106605416200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106605416237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1055825 + ... + 1152378.
It is an arithmetic number, because the mean of its divisors is an integer number (13911685200).
Almost surely, 2106605416231 is an apocalyptic number.
106605416231 is a deficient number, since it is larger than the sum of its proper divisors (4688065369).
106605416231 is a wasteful number, since it uses less digits than its factorization.
106605416231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2210325.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 106605416231 in words is "one hundred six billion, six hundred five million, four hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •