Base | Representation |
---|---|
bin | 101000101000… |
… | …010100100000 |
3 | 202001010022020 |
4 | 220220110200 |
5 | 10211312122 |
6 | 1020141440 |
7 | 156350136 |
oct | 50502440 |
9 | 22033266 |
10 | 10650912 |
11 | 6015208 |
12 | 3697880 |
13 | 228bc1c |
14 | 15b3756 |
15 | e05c5c |
hex | a28520 |
10650912 has 24 divisors (see below), whose sum is σ = 27958896. Its totient is φ = 3550272.
The previous prime is 10650911. The next prime is 10650929. The reversal of 10650912 is 21905601.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×106509122 = 226883852863488, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10650911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55378 + ... + 55569.
It is an arithmetic number, because the mean of its divisors is an integer number (1164954).
Almost surely, 210650912 is an apocalyptic number.
10650912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10650912 is an abundant number, since it is smaller than the sum of its proper divisors (17307984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10650912 is a wasteful number, since it uses less digits than its factorization.
10650912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110960 (or 110952 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 24.
The square root of 10650912 is about 3263.5735015470. The cubic root of 10650912 is about 220.0200532685.
The spelling of 10650912 in words is "ten million, six hundred fifty thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •