Base | Representation |
---|---|
bin | 101001101010… |
… | …000110101100 |
3 | 202112210220221 |
4 | 221222012230 |
5 | 10243422424 |
6 | 1030021124 |
7 | 161551540 |
oct | 51520654 |
9 | 22483827 |
10 | 10920364 |
11 | 61896a4 |
12 | 37a77a4 |
13 | 2354770 |
14 | 1643a20 |
15 | e5a9e4 |
hex | a6a1ac |
10920364 has 48 divisors (see below), whose sum is σ = 24774400. Its totient is φ = 4090176.
The previous prime is 10920361. The next prime is 10920367. The reversal of 10920364 is 46302901.
It is an interprime number because it is at equal distance from previous prime (10920361) and next prime (10920367).
It is not an unprimeable number, because it can be changed into a prime (10920361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6127 + ... + 7705.
Almost surely, 210920364 is an apocalyptic number.
10920364 is a gapful number since it is divisible by the number (14) 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 10920364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12387200).
10920364 is an abundant number, since it is smaller than the sum of its proper divisors (13854036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10920364 is a wasteful number, since it uses less digits than its factorization.
10920364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622 (or 1620 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 10920364 is about 3304.5974036182. The cubic root of 10920364 is about 221.8600150959.
The spelling of 10920364 in words is "ten million, nine hundred twenty thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •