Base | Representation |
---|---|
bin | 110001100111111011… |
… | …1001010110101111111 |
3 | 101012001210210012201021 |
4 | 1203033313022311333 |
5 | 3221222014424101 |
6 | 120542255125011 |
7 | 10461550552441 |
oct | 1431767126577 |
9 | 335053705637 |
10 | 106566561151 |
11 | 41216055746 |
12 | 187a0b13767 |
13 | a084096a9b |
14 | 522d1d0491 |
15 | 2b8a9875a1 |
hex | 18cfdcad7f |
106566561151 has 8 divisors (see below), whose sum is σ = 108093525408. Its totient is φ = 105040320000.
The previous prime is 106566561133. The next prime is 106566561197. The reversal of 106566561151 is 151165665601.
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 106566561151 - 211 = 106566559103 is a prime.
It is a super-2 number, since 2×1065665611512 (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 = 106566561098 and 106566561107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106566568151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119631 + ... + 476911.
It is an arithmetic number, because the mean of its divisors is an integer number (13511690676).
Almost surely, 2106566561151 is an apocalyptic number.
106566561151 is a deficient number, since it is larger than the sum of its proper divisors (1526964257).
106566561151 is an equidigital number, since it uses as much as digits as its factorization.
106566561151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361553.
The product of its (nonzero) digits is 162000, while the sum is 43.
The spelling of 106566561151 in words is "one hundred six billion, five hundred sixty-six million, five hundred sixty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •