Base | Representation |
---|---|
bin | 1100101010000… |
… | …00010110011001 |
3 | 21101202222112002 |
4 | 12111000112121 |
5 | 204134413003 |
6 | 14311330345 |
7 | 2426266544 |
oct | 625002631 |
9 | 241688462 |
10 | 106169753 |
11 | 54a259a8 |
12 | 2b6809b5 |
13 | 18cc3b51 |
14 | 1015985b |
15 | 94c2a88 |
hex | 6540599 |
106169753 has 2 divisors, whose sum is σ = 106169754. Its totient is φ = 106169752.
The previous prime is 106169717. The next prime is 106169809. The reversal of 106169753 is 357961601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104796169 + 1373584 = 10237^2 + 1172^2 .
It is an emirp because it is prime and its reverse (357961601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106169753 - 26 = 106169689 is a prime.
It is a super-2 number, since 2×1061697532 = 22544032904162018, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (106169053) 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, 53084876 + 53084877.
It is an arithmetic number, because the mean of its divisors is an integer number (53084877).
Almost surely, 2106169753 is an apocalyptic number.
It is an amenable number.
106169753 is a deficient number, since it is larger than the sum of its proper divisors (1).
106169753 is an equidigital number, since it uses as much as digits as its factorization.
106169753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34020, while the sum is 38.
The square root of 106169753 is about 10303.8707775282. The cubic root of 106169753 is about 473.5148486642.
The spelling of 106169753 in words is "one hundred six million, one hundred sixty-nine thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •