Base | Representation |
---|---|
bin | 101001000010… |
… | …001111111101 |
3 | 202020111222202 |
4 | 221002033331 |
5 | 10223211432 |
6 | 1022321245 |
7 | 160301600 |
oct | 51021775 |
9 | 22214882 |
10 | 10757117 |
11 | 6087a88 |
12 | 3729225 |
13 | 22c8377 |
14 | 1600337 |
15 | e27462 |
hex | a423fd |
10757117 has 6 divisors (see below), whose sum is σ = 12513438. Its totient is φ = 9220344.
The previous prime is 10757111. The next prime is 10757143. The reversal of 10757117 is 71175701.
It can be written as a sum of positive squares in only one way, i.e., 10686361 + 70756 = 3269^2 + 266^2 .
It is not a de Polignac number, because 10757117 - 26 = 10757053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10757117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10757111) 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 5 ways as a sum of consecutive naturals, for example, 109718 + ... + 109815.
It is an arithmetic number, because the mean of its divisors is an integer number (2085573).
Almost surely, 210757117 is an apocalyptic number.
It is an amenable number.
10757117 is a deficient number, since it is larger than the sum of its proper divisors (1756321).
10757117 is an equidigital number, since it uses as much as digits as its factorization.
10757117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219547 (or 219540 counting only the distinct ones).
The product of its (nonzero) digits is 1715, while the sum is 29.
The square root of 10757117 is about 3279.8044149004. The cubic root of 10757117 is about 220.7489419876.
It can be divided in two parts, 1075 and 7117, that added together give a 13-th power (8192 = 213).
The spelling of 10757117 in words is "ten million, seven hundred fifty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •