Base | Representation |
---|---|
bin | 10011011010011010… |
… | …01111101001100110 |
3 | 222220100001201011122 |
4 | 21231031033221212 |
5 | 132321030414420 |
6 | 4442102133542 |
7 | 516161404400 |
oct | 115515175146 |
9 | 28810051148 |
10 | 10422123110 |
11 | 4469020393 |
12 | 202a4212b2 |
13 | ca12a6669 |
14 | 70c245b70 |
15 | 40ee91725 |
hex | 26d34fa66 |
10422123110 has 24 divisors (see below), whose sum is σ = 21822650640. Its totient is φ = 3573299184.
The previous prime is 10422123079. The next prime is 10422123113. The reversal of 10422123110 is 1132122401.
10422123110 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10422123113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10634330 + ... + 10635309.
It is an arithmetic number, because the mean of its divisors is an integer number (909277110).
Almost surely, 210422123110 is an apocalyptic number.
10422123110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10422123110 is an abundant number, since it is smaller than the sum of its proper divisors (11400527530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10422123110 is a wasteful number, since it uses less digits than its factorization.
10422123110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21269660 (or 21269653 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10422123110 its reverse (1132122401), we get a palindrome (11554245511).
The spelling of 10422123110 in words is "ten billion, four hundred twenty-two million, one hundred twenty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •