Base | Representation |
---|---|
bin | 1100100111000… |
… | …11101100001001 |
3 | 21101001200220012 |
4 | 12103203230021 |
5 | 204040241332 |
6 | 14255241305 |
7 | 2423126201 |
oct | 623435411 |
9 | 241050805 |
10 | 105790217 |
11 | 54796835 |
12 | 2b519235 |
13 | 18bc0180 |
14 | 1009b401 |
15 | 944a3b2 |
hex | 64e3b09 |
105790217 has 8 divisors (see below), whose sum is σ = 114255624. Its totient is φ = 97371648.
The previous prime is 105790207. The next prime is 105790219. The reversal of 105790217 is 712097501.
It can be written as a sum of positive squares in 4 ways, for example, as 8649481 + 97140736 = 2941^2 + 9856^2 .
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 105790217 - 222 = 101595913 is a prime.
It is a super-2 number, since 2×1057902172 = 22383140025814178, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105790219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6938 + ... + 16115.
It is an arithmetic number, because the mean of its divisors is an integer number (14281953).
Almost surely, 2105790217 is an apocalyptic number.
It is an amenable number.
105790217 is a deficient number, since it is larger than the sum of its proper divisors (8465407).
105790217 is a wasteful number, since it uses less digits than its factorization.
105790217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23419.
The product of its (nonzero) digits is 4410, while the sum is 32.
The square root of 105790217 is about 10285.4371321787. The cubic root of 105790217 is about 472.9499341365.
The spelling of 105790217 in words is "one hundred five million, seven hundred ninety thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •