Base | Representation |
---|---|
bin | 101000000111… |
… | …101000011110 |
3 | 201210022122100 |
4 | 220013220132 |
5 | 10143021042 |
6 | 1013225530 |
7 | 155251605 |
oct | 50075036 |
9 | 21708570 |
10 | 10517022 |
11 | 5a3365a |
12 | 36322a6 |
13 | 2242cb9 |
14 | 157aa3c |
15 | dcb24c |
hex | a07a1e |
10517022 has 12 divisors (see below), whose sum is σ = 22786920. Its totient is φ = 3505668.
The previous prime is 10517011. The next prime is 10517047. The reversal of 10517022 is 22071501.
It is a super-2 number, since 2×105170222 = 221215503496968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 584279 = 10517022 / (1 + 0 + 5 + 1 + 7 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10516986 and 10517004.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 292122 + ... + 292157.
It is an arithmetic number, because the mean of its divisors is an integer number (1898910).
Almost surely, 210517022 is an apocalyptic number.
10517022 is an abundant number, since it is smaller than the sum of its proper divisors (12269898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10517022 is a wasteful number, since it uses less digits than its factorization.
10517022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584287 (or 584284 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 10517022 is about 3242.9958371851. The cubic root of 10517022 is about 219.0942235446.
Adding to 10517022 its reverse (22071501), we get a palindrome (32588523).
The spelling of 10517022 in words is "ten million, five hundred seventeen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •