Base | Representation |
---|---|
bin | 10010101001010010… |
… | …101000001111101000 |
3 | 1220200020100120011201 |
4 | 102221102220033220 |
5 | 312000121231440 |
6 | 13110324133544 |
7 | 1306055026444 |
oct | 225122501750 |
9 | 56606316151 |
10 | 20020102120 |
11 | 854390a047 |
12 | 3a688372b4 |
13 | 1b708c5695 |
14 | d7cc39824 |
15 | 7c28dc19a |
hex | 4a94a83e8 |
20020102120 has 16 divisors (see below), whose sum is σ = 45045229860. Its totient is φ = 8008040832.
The previous prime is 20020102061. The next prime is 20020102127. The reversal of 20020102120 is 2120102002.
It can be written as a sum of positive squares in 2 ways, for example, as 18486753156 + 1533348964 = 135966^2 + 39158^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 20020102097 and 20020102106.
It is not an unprimeable number, because it can be changed into a prime (20020102127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250251237 + ... + 250251316.
Almost surely, 220020102120 is an apocalyptic number.
20020102120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20020102120 is an abundant number, since it is smaller than the sum of its proper divisors (25025127740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020102120 is a wasteful number, since it uses less digits than its factorization.
20020102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500502564 (or 500502560 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 20020102120 its reverse (2120102002), we get a palindrome (22140204122).
The spelling of 20020102120 in words is "twenty billion, twenty million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •