Base | Representation |
---|---|
bin | 11011010101001011000010… |
… | …110000011011011110100101 |
3 | 120202121012221112120020212112 |
4 | 123111023002300123132211 |
5 | 111223343122342034341 |
6 | 1103352045532530405 |
7 | 34214216056540220 |
oct | 3325130260333645 |
9 | 522535845506775 |
10 | 120202222221221 |
11 | 35333526862078 |
12 | 11593bb5020a05 |
13 | 520c036c5a93a |
14 | 2197b663345b7 |
15 | dd6b07c35aeb |
hex | 6d52c2c1b7a5 |
120202222221221 has 8 divisors (see below), whose sum is σ = 137979139920960. Its totient is φ = 102576597438528.
The previous prime is 120202222221203. The next prime is 120202222221241. The reversal of 120202222221221 is 122122222202021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120202222221221 - 242 = 115804175710117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120202222221241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37823227556 + ... + 37823230733.
It is an arithmetic number, because the mean of its divisors is an integer number (17247392490120).
Almost surely, 2120202222221221 is an apocalyptic number.
It is an amenable number.
120202222221221 is a deficient number, since it is larger than the sum of its proper divisors (17776917699739).
120202222221221 is an equidigital number, since it uses as much as digits as its factorization.
120202222221221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75646458523.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 120202222221221 its reverse (122122222202021), we get a palindrome (242324444423242).
The spelling of 120202222221221 in words is "one hundred twenty trillion, two hundred two billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •