Base | Representation |
---|---|
bin | 10010110110101001… |
… | …10010100000100100 |
3 | 222010102112111221110 |
4 | 21123110302200210 |
5 | 131212230023022 |
6 | 4352223545020 |
7 | 505556344506 |
oct | 113324624044 |
9 | 28112474843 |
10 | 10122111012 |
11 | 4324738902 |
12 | 1b65a5b170 |
13 | c540a3200 |
14 | 6c046bd76 |
15 | 3e397e00c |
hex | 25b532824 |
10122111012 has 72 divisors (see below), whose sum is σ = 25598397216. Its totient is φ = 3111623424.
The previous prime is 10122111001. The next prime is 10122111023. The reversal of 10122111012 is 21011122101.
It is an interprime number because it is at equal distance from previous prime (10122111001) and next prime (10122111023).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3541488 + ... + 3544344.
Almost surely, 210122111012 is an apocalyptic number.
10122111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10122111012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12799198608).
10122111012 is an abundant number, since it is smaller than the sum of its proper divisors (15476286204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122111012 is a wasteful number, since it uses less digits than its factorization.
10122111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4637 (or 4622 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10122111012 its reverse (21011122101), we get a palindrome (31133233113).
The spelling of 10122111012 in words is "ten billion, one hundred twenty-two million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •