Base | Representation |
---|---|
bin | 11011110010010001101010… |
… | …110101111001110010001010 |
3 | 121000200102020120101211100100 |
4 | 123302101222311321302022 |
5 | 112004130102204133002 |
6 | 1111522525552550230 |
7 | 34511550325413435 |
oct | 3362215265716212 |
9 | 530612216354310 |
10 | 122202202021002 |
11 | 35a34732266164 |
12 | 11857732252376 |
13 | 532580626b6cc |
14 | 222689224681c |
15 | e1db5e07311c |
hex | 6f246ad79c8a |
122202202021002 has 48 divisors (see below), whose sum is σ = 266170348753920. Its totient is φ = 40518870568800.
The previous prime is 122202202020961. The next prime is 122202202021007. The reversal of 122202202021002 is 200120202202221.
122202202021002 is a `hidden beast` number, since 12 + 220 + 220 + 2 + 0 + 210 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (122202202021007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72287227 + ... + 73958417.
It is an arithmetic number, because the mean of its divisors is an integer number (5545215599040).
Almost surely, 2122202202021002 is an apocalyptic number.
122202202021002 is an abundant number, since it is smaller than the sum of its proper divisors (143968146732918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122202202021002 is a wasteful number, since it uses less digits than its factorization.
122202202021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1692659 (or 1692656 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 122202202021002 its reverse (200120202202221), we get a palindrome (322322404223223).
The spelling of 122202202021002 in words is "one hundred twenty-two trillion, two hundred two billion, two hundred two million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •