Base | Representation |
---|---|
bin | 11011100001000100110000… |
… | …001000011000001111011000 |
3 | 120212111102000220210011122110 |
4 | 123201010300020120033120 |
5 | 111330243131324032300 |
6 | 1105215511125352320 |
7 | 34330261630505151 |
oct | 3341046010301730 |
9 | 525442026704573 |
10 | 121020101002200 |
11 | 35619378034614 |
12 | 116a660ab686a0 |
13 | 526b1b9ca4b4a |
14 | 21c5592d70928 |
15 | ded025939550 |
hex | 6e11302183d8 |
121020101002200 has 96 divisors (see below), whose sum is σ = 385301835153360. Its totient is φ = 31399809984000.
The previous prime is 121020101002169. The next prime is 121020101002231. The reversal of 121020101002200 is 2200101020121.
It is an interprime number because it is at equal distance from previous prime (121020101002169) and next prime (121020101002231).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2725655751 + ... + 2725700150.
Almost surely, 2121020101002200 is an apocalyptic number.
121020101002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121020101002200 is an abundant number, since it is smaller than the sum of its proper divisors (264281734151160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121020101002200 is a wasteful number, since it uses less digits than its factorization.
121020101002200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5451355957 (or 5451355948 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 121020101002200 its reverse (2200101020121), we get a palindrome (123220202022321).
The spelling of 121020101002200 in words is "one hundred twenty-one trillion, twenty billion, one hundred one million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •