Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00001101000101010101000 |
3 | 2122011122012022201001002210 |
4 | 10210200201001220222220 |
5 | 10113313322230201440 |
6 | 110430134500325120 |
7 | 4143151354366134 |
oct | 444404101505250 |
9 | 78148168631083 |
10 | 20101001022120 |
11 | 644a872054947 |
12 | 23078606a37a0 |
13 | b2a6932ca955 |
14 | 4d6c722143c4 |
15 | 24cd16e04a80 |
hex | 124821068aa8 |
20101001022120 has 128 divisors (see below), whose sum is σ = 63405080208000. Its totient is φ = 5090586977280.
The previous prime is 20101001022119. The next prime is 20101001022131. The reversal of 20101001022120 is 2122010010102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 20101001022096 and 20101001022105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47133210 + ... + 47557769.
It is an arithmetic number, because the mean of its divisors is an integer number (495352189125).
Almost surely, 220101001022120 is an apocalyptic number.
20101001022120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20101001022120 is an abundant number, since it is smaller than the sum of its proper divisors (43304079185880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101001022120 is a wasteful number, since it uses less digits than its factorization.
20101001022120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94691083 (or 94691079 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20101001022120 its reverse (2122010010102), we get a palindrome (22223011032222).
The spelling of 20101001022120 in words is "twenty trillion, one hundred one billion, one million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •