Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …111010000111011001100110 |
3 | 120220012121122101120211222202 |
4 | 123203333313322013121212 |
5 | 111342041122411431042 |
6 | 1105452100210454502 |
7 | 34350633624151400 |
oct | 3343776772073146 |
9 | 526177571524882 |
10 | 121221021202022 |
11 | 35696601274535 |
12 | 11719542894432 |
13 | 5284129b40a51 |
14 | 21d11b3349b70 |
15 | e03384a7a632 |
hex | 6e3ff7e87666 |
121221021202022 has 12 divisors (see below), whose sum is σ = 211518312505740. Its totient is φ = 51951866229396.
The previous prime is 121221021202007. The next prime is 121221021202033. The reversal of 121221021202022 is 220202120122121.
It is a super-2 number, since 2×1212210212020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121221021201985 and 121221021202003.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 618474597872 + ... + 618474598067.
It is an arithmetic number, because the mean of its divisors is an integer number (17626526042145).
Almost surely, 2121221021202022 is an apocalyptic number.
121221021202022 is a deficient number, since it is larger than the sum of its proper divisors (90297291303718).
121221021202022 is a wasteful number, since it uses less digits than its factorization.
121221021202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236949195955 (or 1236949195948 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 121221021202022 its reverse (220202120122121), we get a palindrome (341423141324143).
The spelling of 121221021202022 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty-one million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •