Base | Representation |
---|---|
bin | 101000100100… |
… | …010011101000 |
3 | 202000021202100 |
4 | 220210103220 |
5 | 10210300342 |
6 | 1015533400 |
7 | 156251202 |
oct | 50442350 |
9 | 22007670 |
10 | 10634472 |
11 | 6003922 |
12 | 368a260 |
13 | 22845b4 |
14 | 15ab772 |
15 | e00e4c |
hex | a244e8 |
10634472 has 48 divisors (see below), whose sum is σ = 29053440. Its totient is φ = 3513888.
The previous prime is 10634467. The next prime is 10634479. The reversal of 10634472 is 27443601.
It is a super-2 number, since 2×106344722 = 226183989437568, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10634479) 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, 8563 + ... + 9725.
It is an arithmetic number, because the mean of its divisors is an integer number (605280).
Almost surely, 210634472 is an apocalyptic number.
10634472 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 10634472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14526720).
10634472 is an abundant number, since it is smaller than the sum of its proper divisors (18418968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10634472 is a wasteful number, since it uses less digits than its factorization.
10634472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1302 (or 1295 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 10634472 is about 3261.0538174032. The cubic root of 10634472 is about 219.9067924722.
The spelling of 10634472 in words is "ten million, six hundred thirty-four thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •