Base | Representation |
---|---|
bin | 100110101000… |
… | …010001010110 |
3 | 201001110211200 |
4 | 212220101112 |
5 | 10043021142 |
6 | 1001013330 |
7 | 152034045 |
oct | 46502126 |
9 | 21043750 |
10 | 10126422 |
11 | 5797149 |
12 | 3484246 |
13 | 2137287 |
14 | 14b855c |
15 | d5064c |
hex | 9a8456 |
10126422 has 12 divisors (see below), whose sum is σ = 21940620. Its totient is φ = 3375468.
The previous prime is 10126421. The next prime is 10126439. The reversal of 10126422 is 22462101.
10126422 is a `hidden beast` number, since 10 + 12 + 642 + 2 = 666.
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: 562579 = 10126422 / (1 + 0 + 1 + 2 + 6 + 4 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10126395 and 10126404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10126421) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 281272 + ... + 281307.
It is an arithmetic number, because the mean of its divisors is an integer number (1828385).
Almost surely, 210126422 is an apocalyptic number.
10126422 is an abundant number, since it is smaller than the sum of its proper divisors (11814198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10126422 is a wasteful number, since it uses less digits than its factorization.
10126422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 562587 (or 562584 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 10126422 is about 3182.2039532374. The cubic root of 10126422 is about 216.3475628690.
Adding to 10126422 its reverse (22462101), we get a palindrome (32588523).
The spelling of 10126422 in words is "ten million, one hundred twenty-six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •