Base | Representation |
---|---|
bin | 1100101011110… |
… | …11001110010101 |
3 | 21102020020022111 |
4 | 12111323032111 |
5 | 204220122101 |
6 | 14320431021 |
7 | 2431322602 |
oct | 625731625 |
9 | 242206274 |
10 | 106410901 |
11 | 550800a3 |
12 | 2b778471 |
13 | 1907983c |
14 | 101bd6a9 |
15 | 951e251 |
hex | 657b395 |
106410901 has 4 divisors (see below), whose sum is σ = 108155404. Its totient is φ = 104666400.
The previous prime is 106410893. The next prime is 106410911. The reversal of 106410901 is 109014601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 109014601 = 151 ⋅721951.
It can be written as a sum of positive squares in 2 ways, for example, as 8994001 + 97416900 = 2999^2 + 9870^2 .
It is a cyclic number.
It is not a de Polignac number, because 106410901 - 23 = 106410893 is a prime.
It is a super-2 number, since 2×1064109012 = 22646559703263602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106410911) 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, 872160 + ... + 872281.
It is an arithmetic number, because the mean of its divisors is an integer number (27038851).
Almost surely, 2106410901 is an apocalyptic number.
It is an amenable number.
106410901 is a deficient number, since it is larger than the sum of its proper divisors (1744503).
106410901 is an equidigital number, since it uses as much as digits as its factorization.
106410901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1744502.
The product of its (nonzero) digits is 216, while the sum is 22.
The square root of 106410901 is about 10315.5659563594. The cubic root of 106410901 is about 473.8730825669.
The spelling of 106410901 in words is "one hundred six million, four hundred ten thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •