Base | Representation |
---|---|
bin | 1100001110101011110… |
… | …0010111000111110110 |
3 | 202002022020110001022210 |
4 | 3003222330113013312 |
5 | 11420241112401402 |
6 | 240304010434250 |
7 | 21115322400063 |
oct | 3035274270766 |
9 | 662266401283 |
10 | 210100122102 |
11 | 81115050452 |
12 | 34876132986 |
13 | 16a739938a0 |
14 | a251667c6a |
15 | 56ea00d06c |
hex | 30eaf171f6 |
210100122102 has 64 divisors (see below), whose sum is σ = 463746286080. Its totient is φ = 63044179200.
The previous prime is 210100122073. The next prime is 210100122109. The reversal of 210100122102 is 201221001012.
It is a super-2 number, since 2×2101001221022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210100122109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8913849 + ... + 8937387.
It is an arithmetic number, because the mean of its divisors is an integer number (7246035720).
Almost surely, 2210100122102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 210100122102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231873143040).
210100122102 is an abundant number, since it is smaller than the sum of its proper divisors (253646163978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210100122102 is a wasteful number, since it uses less digits than its factorization.
210100122102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26389.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210100122102 its reverse (201221001012), we get a palindrome (411321123114).
The spelling of 210100122102 in words is "two hundred ten billion, one hundred million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •