Base | Representation |
---|---|
bin | 101000100010… |
… | …111111010000 |
3 | 202000000100100 |
4 | 220202333100 |
5 | 10210112242 |
6 | 1015452400 |
7 | 156226356 |
oct | 50427720 |
9 | 22000310 |
10 | 10629072 |
11 | 5aaa863 |
12 | 3687100 |
13 | 2281cbc |
14 | 15a97d6 |
15 | dee54c |
hex | a22fd0 |
10629072 has 60 divisors (see below), whose sum is σ = 29970304. Its totient is φ = 3516480.
The previous prime is 10629071. The next prime is 10629077. The reversal of 10629072 is 27092601.
It is a super-2 number, since 2×106290722 = 225954343162368, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10629071) 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 11 ways as a sum of consecutive naturals, for example, 31947 + ... + 32277.
Almost surely, 210629072 is an apocalyptic number.
10629072 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 10629072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14985152).
10629072 is an abundant number, since it is smaller than the sum of its proper divisors (19341232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10629072 is a wasteful number, since it uses less digits than its factorization.
10629072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568 (or 559 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 10629072 is about 3260.2257590541. The cubic root of 10629072 is about 219.8695645549.
The spelling of 10629072 in words is "ten million, six hundred twenty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •