Base | Representation |
---|---|
bin | 11011100000110100000101… |
… | …001101110000010110011010 |
3 | 120212102200211110000001110000 |
4 | 123200310011031300112122 |
5 | 111330000001441402302 |
6 | 1105203351021033430 |
7 | 34326056226155121 |
oct | 3340640515602632 |
9 | 525380743001400 |
10 | 121002201122202 |
11 | 35611822015864 |
12 | 116a30543b5876 |
13 | 52695c672a88a |
14 | 21c4775966ab8 |
15 | dec82925b31c |
hex | 6e0d0537059a |
121002201122202 has 20 divisors (see below), whose sum is σ = 271134561774186. Its totient is φ = 40334067040680.
The previous prime is 121002201122191. The next prime is 121002201122219. The reversal of 121002201122202 is 202221102200121.
It is a happy number.
121002201122202 is a `hidden beast` number, since 1 + 210 + 0 + 220 + 1 + 12 + 220 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 97944255229041 + 23057945893161 = 9896679^2 + 4801869^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 373463583549 + ... + 373463583872.
Almost surely, 2121002201122202 is an apocalyptic number.
121002201122202 is an abundant number, since it is smaller than the sum of its proper divisors (150132360651984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121002201122202 is an equidigital number, since it uses as much as digits as its factorization.
121002201122202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746927167435 (or 746927167426 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 121002201122202 its reverse (202221102200121), we get a palindrome (323223303322323).
The spelling of 121002201122202 in words is "one hundred twenty-one trillion, two billion, two hundred one million, one hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •