Base | Representation |
---|---|
bin | 10010101110101001… |
… | …111100101001101110 |
3 | 1220220111200222120100 |
4 | 102232221330221232 |
5 | 312141141213402 |
6 | 13123301131530 |
7 | 1311230016240 |
oct | 225651745156 |
9 | 56814628510 |
10 | 20110101102 |
11 | 858a69a673 |
12 | 3a929b9ba6 |
13 | 1b86447010 |
14 | d8ab86090 |
15 | 7ca76871c |
hex | 4aea7ca6e |
20110101102 has 192 divisors, whose sum is σ = 55282631040. Its totient is φ = 5141117952.
The previous prime is 20110101071. The next prime is 20110101103.
It is a happy number.
20110101102 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×201101011022 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110101103) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23575308 + ... + 23576160.
It is an arithmetic number, because the mean of its divisors is an integer number (287930370).
Almost surely, 220110101102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20110101102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27641315520).
20110101102 is an abundant number, since it is smaller than the sum of its proper divisors (35172529938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110101102 is a wasteful number, since it uses less digits than its factorization.
20110101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1307 (or 1304 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The spelling of 20110101102 in words is "twenty billion, one hundred ten million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •