Base | Representation |
---|---|
bin | 10010110110101000… |
… | …10111111011000000 |
3 | 222010102022222120010 |
4 | 21123110113323000 |
5 | 131212213031422 |
6 | 4352221344520 |
7 | 505555412145 |
oct | 113324277300 |
9 | 28112288503 |
10 | 10122002112 |
11 | 4324674002 |
12 | 1b65a08140 |
13 | c54065781 |
14 | 6c04403cc |
15 | 3e395bb0c |
hex | 25b517ec0 |
10122002112 has 56 divisors (see below), whose sum is σ = 26901339136. Its totient is φ = 3358856448.
The previous prime is 10122002087. The next prime is 10122002161. The reversal of 10122002112 is 21120022101.
10122002112 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 (12).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 75388 + ... + 161019.
It is an arithmetic number, because the mean of its divisors is an integer number (480381056).
Almost surely, 210122002112 is an apocalyptic number.
10122002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10122002112 is an abundant number, since it is smaller than the sum of its proper divisors (16779337024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122002112 is a wasteful number, since it uses less digits than its factorization.
10122002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236645 (or 236635 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10122002112 its reverse (21120022101), we get a palindrome (31242024213).
The spelling of 10122002112 in words is "ten billion, one hundred twenty-two million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •