Base | Representation |
---|---|
bin | 1001000110001000110110… |
… | …10100101101000111110000 |
3 | 2121211011222012201001120101 |
4 | 10203010123110231013300 |
5 | 10110203321001010000 |
6 | 110312503024522144 |
7 | 4133051131120021 |
oct | 443043324550760 |
9 | 77734865631511 |
10 | 20002121110000 |
11 | 6411940a04407 |
12 | 22b0665a80354 |
13 | b21265883303 |
14 | 4d2171c40c48 |
15 | 24a47b1bce6a |
hex | 12311b52d1f0 |
20002121110000 has 50 divisors (see below), whose sum is σ = 48427135443632. Its totient is φ = 8000848440000.
The previous prime is 20002121109967. The next prime is 20002121110001. The reversal of 20002121110000 is 1112120002.
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002121110001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1000096056 + ... + 1000116055.
Almost surely, 220002121110000 is an apocalyptic number.
20002121110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20002121110000 is an abundant number, since it is smaller than the sum of its proper divisors (28425014333632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002121110000 is an equidigital number, since it uses as much as digits as its factorization.
20002121110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2000212139 (or 2000212118 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20002121110000 its reverse (1112120002), we get a palindrome (20003233230002).
The spelling of 20002121110000 in words is "twenty trillion, two billion, one hundred twenty-one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •