Base | Representation |
---|---|
bin | 101000100001… |
… | …001111100000 |
3 | 201222122112110 |
4 | 220201033200 |
5 | 10204400140 |
6 | 1015355320 |
7 | 156166461 |
oct | 50411740 |
9 | 21878473 |
10 | 10621920 |
11 | 5aa5451 |
12 | 3682b40 |
13 | 227b97a |
14 | 15a6d68 |
15 | dec380 |
hex | a213e0 |
10621920 has 48 divisors (see below), whose sum is σ = 33460560. Its totient is φ = 2832384.
The previous prime is 10621913. The next prime is 10621927. The reversal of 10621920 is 2912601.
It is an interprime number because it is at equal distance from previous prime (10621913) and next prime (10621927).
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×106219202 = 225650368972800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10621927) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10585 + ... + 11544.
It is an arithmetic number, because the mean of its divisors is an integer number (697095).
Almost surely, 210621920 is an apocalyptic number.
10621920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10621920 is an abundant number, since it is smaller than the sum of its proper divisors (22838640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10621920 is a wasteful number, since it uses less digits than its factorization.
10621920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22147 (or 22139 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 10621920 is about 3259.1287179245. The cubic root of 10621920 is about 219.8202388328.
The spelling of 10621920 in words is "ten million, six hundred twenty-one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •