Base | Representation |
---|---|
bin | 11011100000110100110110… |
… | …001001111011010101011000 |
3 | 120212102202221200000020110022 |
4 | 123200310312021323111120 |
5 | 111330003142140432300 |
6 | 1105204004311410012 |
7 | 34326115456216265 |
oct | 3340646611732530 |
9 | 525382850006408 |
10 | 121003022202200 |
11 | 35612103544376 |
12 | 116a3243383908 |
13 | 52696c7881628 |
14 | 21c4812a1c26c |
15 | dec876399285 |
hex | 6e0d3627b558 |
121003022202200 has 48 divisors (see below), whose sum is σ = 281388037721280. Its totient is φ = 48391572562560.
The previous prime is 121003022202193. The next prime is 121003022202229. The reversal of 121003022202200 is 2202220300121.
It is a super-2 number, since 2×1210030222022002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59219879 + ... + 61229078.
It is an arithmetic number, because the mean of its divisors is an integer number (5862250785860).
Almost surely, 2121003022202200 is an apocalyptic number.
121003022202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121003022202200 is an abundant number, since it is smaller than the sum of its proper divisors (160385015519080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121003022202200 is a wasteful number, since it uses less digits than its factorization.
121003022202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120453996 (or 120453987 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 121003022202200 its reverse (2202220300121), we get a palindrome (123205242502321).
The spelling of 121003022202200 in words is "one hundred twenty-one trillion, three billion, twenty-two million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •