Base | Representation |
---|---|
bin | 101001101001… |
… | …010100100000 |
3 | 202112122111222 |
4 | 221221110200 |
5 | 10243322102 |
6 | 1025554212 |
7 | 161536301 |
oct | 51512440 |
9 | 22478458 |
10 | 10917152 |
11 | 6187244 |
12 | 37a5968 |
13 | 235316c |
14 | 16427a8 |
15 | e59aa2 |
hex | a69520 |
10917152 has 48 divisors (see below), whose sum is σ = 22575672. Its totient is φ = 5191680.
The previous prime is 10917139. The next prime is 10917161. The reversal of 10917152 is 25171901.
It can be written as a sum of positive squares in 4 ways, for example, as 6739216 + 4177936 = 2596^2 + 2044^2 .
It is a super-2 number, since 2×109171522 = 238368415582208, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69458 + ... + 69614.
Almost surely, 210917152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10917152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11287836).
10917152 is an abundant number, since it is smaller than the sum of its proper divisors (11658520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10917152 is a wasteful number, since it uses less digits than its factorization.
10917152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261 (or 253 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 26.
The square root of 10917152 is about 3304.1113782680. Note that the first 3 decimals coincide. The cubic root of 10917152 is about 221.8382611126.
The spelling of 10917152 in words is "ten million, nine hundred seventeen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •