Base | Representation |
---|---|
bin | 10011011010001011… |
… | …00011010010110110 |
3 | 222220012021020210111 |
4 | 21231011203102312 |
5 | 132320021401142 |
6 | 4441551013234 |
7 | 516135305005 |
oct | 115505432266 |
9 | 28805236714 |
10 | 10420106422 |
11 | 4467973200 |
12 | 202980a21a |
13 | ca0a4b75b |
14 | 70bc7cc3c |
15 | 40ebe3e17 |
hex | 26d1634b6 |
10420106422 has 24 divisors (see below), whose sum is σ = 17185597128. Its totient is φ = 4734940320.
The previous prime is 10420106413. The next prime is 10420106423. The reversal of 10420106422 is 22460102401.
It is a happy number.
10420106422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 10420106393 and 10420106402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10420106423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1299658 + ... + 1307650.
It is an arithmetic number, because the mean of its divisors is an integer number (716066547).
Almost surely, 210420106422 is an apocalyptic number.
10420106422 is a deficient number, since it is larger than the sum of its proper divisors (6765490706).
10420106422 is a wasteful number, since it uses less digits than its factorization.
10420106422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13404 (or 13393 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10420106422 its reverse (22460102401), we get a palindrome (32880208823).
The spelling of 10420106422 in words is "ten billion, four hundred twenty million, one hundred six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •