Base | Representation |
---|---|
bin | 101101111110100100101101… |
… | …101101010101011110001001 |
3 | 222111222021211110200012102212 |
4 | 231332210231231111132021 |
5 | 203001020411230401441 |
6 | 1554022544431434505 |
7 | 60410225615153516 |
oct | 5576445555253611 |
9 | 874867743605385 |
10 | 202212122122121 |
11 | 59481752308081 |
12 | 1a81a092685a35 |
13 | 88aa6a1394a37 |
14 | 37d11944c230d |
15 | 185a004835eeb |
hex | b7e92db55789 |
202212122122121 has 8 divisors (see below), whose sum is σ = 202644604378464. Its totient is φ = 201779723789280.
The previous prime is 202212122122111. The next prime is 202212122122123. The reversal of 202212122122121 is 121221221212202.
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 202212122122121 - 242 = 197814075611017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (202212122122123) 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, 16155575 + ... + 25795868.
It is an arithmetic number, because the mean of its divisors is an integer number (25330575547308).
Almost surely, 2202212122122121 is an apocalyptic number.
It is an amenable number.
202212122122121 is a deficient number, since it is larger than the sum of its proper divisors (432482256343).
202212122122121 is an equidigital number, since it uses as much as digits as its factorization.
202212122122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41961751.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 202212122122121 its reverse (121221221212202), we get a palindrome (323433343334323).
The spelling of 202212122122121 in words is "two hundred two trillion, two hundred twelve billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •