Base | Representation |
---|---|
bin | 101000100010… |
… | …100101011110 |
3 | 201222221002020 |
4 | 220202211132 |
5 | 10210034142 |
6 | 1015441010 |
7 | 156221511 |
oct | 50424536 |
9 | 21887066 |
10 | 10627422 |
11 | 5aa95a3 |
12 | 3686166 |
13 | 2281320 |
14 | 15a8d78 |
15 | dedcec |
hex | a2295e |
10627422 has 64 divisors (see below), whose sum is σ = 24675840. Its totient is φ = 3024000.
The previous prime is 10627387. The next prime is 10627423. The reversal of 10627422 is 22472601.
It is a super-2 number, since 2×106274222 = 225884196732168, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10627392 and 10627401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10627423) 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 31 ways as a sum of consecutive naturals, for example, 105172 + ... + 105272.
It is an arithmetic number, because the mean of its divisors is an integer number (385560).
Almost surely, 210627422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10627422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12337920).
10627422 is an abundant number, since it is smaller than the sum of its proper divisors (14048418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10627422 is a wasteful number, since it uses less digits than its factorization.
10627422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209.
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 10627422 is about 3259.9726992722. The cubic root of 10627422 is about 219.8581868430.
The spelling of 10627422 in words is "ten million, six hundred twenty-seven thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •