Base | Representation |
---|---|
bin | 101000100001… |
… | …001110110000 |
3 | 201222122110200 |
4 | 220201032300 |
5 | 10204344442 |
6 | 1015355200 |
7 | 156166362 |
oct | 50411660 |
9 | 21878420 |
10 | 10621872 |
11 | 5aa5408 |
12 | 3682b00 |
13 | 227b941 |
14 | 15a6d32 |
15 | dec34c |
hex | a213b0 |
10621872 has 60 divisors (see below), whose sum is σ = 31482360. Its totient is φ = 3331584.
The previous prime is 10621861. The next prime is 10621879. The reversal of 10621872 is 27812601.
It is a super-2 number, since 2×106218722 = 225648329568768, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10621879) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 279 + ... + 4617.
It is an arithmetic number, because the mean of its divisors is an integer number (524706).
Almost surely, 210621872 is an apocalyptic number.
10621872 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 10621872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15741180).
10621872 is an abundant number, since it is smaller than the sum of its proper divisors (20860488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10621872 is a wasteful number, since it uses less digits than its factorization.
10621872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4370 (or 4361 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 10621872 is about 3259.1213539848. The cubic root of 10621872 is about 219.8199077129.
The spelling of 10621872 in words is "ten million, six hundred twenty-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •