Base | Representation |
---|---|
bin | 11011100001000110101101… |
… | …010111100000111100100100 |
3 | 120212111121110100102010012001 |
4 | 123201012231113200330210 |
5 | 111330311432220401040 |
6 | 1105220455423535044 |
7 | 34330364662645003 |
oct | 3341065527407444 |
9 | 525447410363161 |
10 | 121022202122020 |
11 | 3561a256067a81 |
12 | 116a6ab675a484 |
13 | 526b463395604 |
14 | 21c571202cc3a |
15 | ded0ea12359a |
hex | 6e11ad5e0f24 |
121022202122020 has 24 divisors (see below), whose sum is σ = 258454194364800. Its totient is φ = 47588391342432.
The previous prime is 121022202121991. The next prime is 121022202122057. The reversal of 121022202122020 is 20221202220121.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51280592940 + ... + 51280595299.
It is an arithmetic number, because the mean of its divisors is an integer number (10768924765200).
Almost surely, 2121022202122020 is an apocalyptic number.
121022202122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121022202122020 is an abundant number, since it is smaller than the sum of its proper divisors (137431992242780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022202122020 is a wasteful number, since it uses less digits than its factorization.
121022202122020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102561188307 (or 102561188305 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 121022202122020 its reverse (20221202220121), we get a palindrome (141243404342141).
The spelling of 121022202122020 in words is "one hundred twenty-one trillion, twenty-two billion, two hundred two million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •