Base | Representation |
---|---|
bin | 1100101010000… |
… | …00010111010001 |
3 | 21101202222121011 |
4 | 12111000113101 |
5 | 204134413214 |
6 | 14311330521 |
7 | 2426266654 |
oct | 625002721 |
9 | 241688534 |
10 | 106169809 |
11 | 54a25a49 |
12 | 2b680a41 |
13 | 18cc3b95 |
14 | 1015989b |
15 | 94c2ac4 |
hex | 65405d1 |
106169809 has 2 divisors, whose sum is σ = 106169810. Its totient is φ = 106169808.
The previous prime is 106169753. The next prime is 106169821. The reversal of 106169809 is 908961601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55830784 + 50339025 = 7472^2 + 7095^2 .
It is an emirp because it is prime and its reverse (908961601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106169809 - 225 = 72615377 is a prime.
It is a super-2 number, since 2×1061698092 = 22544056686192962, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106169509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53084904 + 53084905.
It is an arithmetic number, because the mean of its divisors is an integer number (53084905).
Almost surely, 2106169809 is an apocalyptic number.
It is an amenable number.
106169809 is a deficient number, since it is larger than the sum of its proper divisors (1).
106169809 is an equidigital number, since it uses as much as digits as its factorization.
106169809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 40.
The square root of 106169809 is about 10303.8734949532. The cubic root of 106169809 is about 473.5149319172.
The spelling of 106169809 in words is "one hundred six million, one hundred sixty-nine thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •