Base | Representation |
---|---|
bin | 10010101000101100… |
… | …100011001110100110 |
3 | 1220122112120102102100 |
4 | 102220230203032212 |
5 | 311440042320402 |
6 | 13105330152530 |
7 | 1305604133400 |
oct | 225054431646 |
9 | 56575512370 |
10 | 20010120102 |
11 | 8539211445 |
12 | 3a65422746 |
13 | 1b6b80c06b |
14 | d7b79bb70 |
15 | 7c1ab971c |
hex | 4a8b233a6 |
20010120102 has 144 divisors (see below), whose sum is σ = 51454802880. Its totient is φ = 5602078944.
The previous prime is 20010120041. The next prime is 20010120131. The reversal of 20010120102 is 20102101002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 29297053 + ... + 29297735.
It is an arithmetic number, because the mean of its divisors is an integer number (357325020).
Almost surely, 220010120102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20010120102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25727401440).
20010120102 is an abundant number, since it is smaller than the sum of its proper divisors (31444682778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20010120102 is a wasteful number, since it uses less digits than its factorization.
20010120102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1327 (or 1317 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20010120102 its reverse (20102101002), we get a palindrome (40112221104).
The spelling of 20010120102 in words is "twenty billion, ten million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •