Base | Representation |
---|---|
bin | 101001000110… |
… | …101011000000 |
3 | 202021102211200 |
4 | 221012223000 |
5 | 10224301412 |
6 | 1022541200 |
7 | 160405446 |
oct | 51065300 |
9 | 22242750 |
10 | 10775232 |
11 | 609a656 |
12 | 3737800 |
13 | 23036a0 |
14 | 1606b96 |
15 | e2c9dc |
hex | a46ac0 |
10775232 has 84 divisors (see below), whose sum is σ = 33284160. Its totient is φ = 3313152.
The previous prime is 10775213. The next prime is 10775243. The reversal of 10775232 is 23257701.
It is a super-2 number, since 2×107752322 = 232211249307648, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10775196 and 10775205.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6769 + ... + 8207.
It is an arithmetic number, because the mean of its divisors is an integer number (396240).
Almost surely, 210775232 is an apocalyptic number.
10775232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10775232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16642080).
10775232 is an abundant number, since it is smaller than the sum of its proper divisors (22508928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10775232 is a wasteful number, since it uses less digits than its factorization.
10775232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1470 (or 1457 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 10775232 is about 3282.5648508445. The cubic root of 10775232 is about 220.8727863374.
The spelling of 10775232 in words is "ten million, seven hundred seventy-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •