Base | Representation |
---|---|
bin | 110001100001111101… |
… | …0010000010000011001 |
3 | 101011112211110211202001 |
4 | 1203003322100100121 |
5 | 3220314201340121 |
6 | 120510333241001 |
7 | 10453564310050 |
oct | 1430372202031 |
9 | 334484424661 |
10 | 106366043161 |
11 | 411229495a4 |
12 | 18745933161 |
13 | a05168aaa1 |
14 | 5210715397 |
15 | 2b78079991 |
hex | 18c3e90419 |
106366043161 has 8 divisors (see below), whose sum is σ = 123375538880. Its totient is φ = 89810134128.
The previous prime is 106366043149. The next prime is 106366043171. The reversal of 106366043161 is 161340663601.
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 106366043161 - 27 = 106366043033 is a prime.
It is a super-2 number, since 2×1063660431612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106366043161.
It is not an unprimeable number, because it can be changed into a prime (106366043171) 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, 113396166 + ... + 113397103.
It is an arithmetic number, because the mean of its divisors is an integer number (15421942360).
Almost surely, 2106366043161 is an apocalyptic number.
It is an amenable number.
106366043161 is a deficient number, since it is larger than the sum of its proper divisors (17009495719).
106366043161 is an equidigital number, since it uses as much as digits as its factorization.
106366043161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226793343.
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 106366043161 in words is "one hundred six billion, three hundred sixty-six million, forty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •