Base | Representation |
---|---|
bin | 1100101010001… |
… | …10110011000001 |
3 | 21101211022202011 |
4 | 12111012303001 |
5 | 204141234121 |
6 | 14312052521 |
7 | 2426436541 |
oct | 625066301 |
9 | 241738664 |
10 | 106196161 |
11 | 54a43825 |
12 | 2b694141 |
13 | 19002b86 |
14 | 10165321 |
15 | 94ca7e1 |
hex | 6546cc1 |
106196161 has 4 divisors (see below), whose sum is σ = 112443012. Its totient is φ = 99949312.
The previous prime is 106196159. The next prime is 106196177. The reversal of 106196161 is 161691601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 161691601 = 461 ⋅350741.
It can be written as a sum of positive squares in 2 ways, for example, as 83156161 + 23040000 = 9119^2 + 4800^2 .
It is a cyclic number.
It is not a de Polignac number, because 106196161 - 21 = 106196159 is a prime.
It is a super-2 number, since 2×1061961612 = 22555249222275842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106196131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3123400 + ... + 3123433.
It is an arithmetic number, because the mean of its divisors is an integer number (28110753).
Almost surely, 2106196161 is an apocalyptic number.
It is an amenable number.
106196161 is a deficient number, since it is larger than the sum of its proper divisors (6246851).
106196161 is an equidigital number, since it uses as much as digits as its factorization.
106196161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6246850.
The product of its (nonzero) digits is 1944, while the sum is 31.
The square root of 106196161 is about 10305.1521580227. The cubic root of 106196161 is about 473.5541051164.
The spelling of 106196161 in words is "one hundred six million, one hundred ninety-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •