Base | Representation |
---|---|
bin | 11011100011110111011110… |
… | …010101011001000011100110 |
3 | 120220011202100211202120212000 |
4 | 123203313132111121003212 |
5 | 111341414140031210042 |
6 | 1105444005230310130 |
7 | 34350164261040153 |
oct | 3343673625310346 |
9 | 526152324676760 |
10 | 121212002210022 |
11 | 356927a3291339 |
12 | 11717846358346 |
13 | 52833204710a9 |
14 | 21d09995cd22a |
15 | e03007d9b74c |
hex | 6e3dde5590e6 |
121212002210022 has 32 divisors (see below), whose sum is σ = 275091068851200. Its totient is φ = 39544341145704.
The previous prime is 121212002210017. The next prime is 121212002210107. The reversal of 121212002210022 is 220012200212121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 121212002209977 and 121212002210004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23879430522 + ... + 23879435597.
It is an arithmetic number, because the mean of its divisors is an integer number (8596595901600).
Almost surely, 2121212002210022 is an apocalyptic number.
121212002210022 is an abundant number, since it is smaller than the sum of its proper divisors (153879066641178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121212002210022 is a wasteful number, since it uses less digits than its factorization.
121212002210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47758866177 (or 47758866171 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 121212002210022 its reverse (220012200212121), we get a palindrome (341224202422143).
The spelling of 121212002210022 in words is "one hundred twenty-one trillion, two hundred twelve billion, two million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •