Base | Representation |
---|---|
bin | 11011101111010110011111… |
… | …011100111011000100011010 |
3 | 120222222012110212112101101201 |
4 | 123233112133130323010122 |
5 | 111442332000111432302 |
6 | 1111250330504304414 |
7 | 34461203664554416 |
oct | 3357263734730432 |
9 | 528865425471351 |
10 | 122001221202202 |
11 | 35967477892311 |
12 | 118247a217210a |
13 | 530c886999ba4 |
14 | 221ac67babd46 |
15 | e187e995ac87 |
hex | 6ef59f73b11a |
122001221202202 has 4 divisors (see below), whose sum is σ = 183001831803306. Its totient is φ = 61000610601100.
The previous prime is 122001221202151. The next prime is 122001221202209. The reversal of 122001221202202 is 202202122100221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 121416575928561 + 584645273641 = 11018919^2 + 764621^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 122001221202202.
It is not an unprimeable number, because it can be changed into a prime (122001221202209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30500305300549 + ... + 30500305300552.
Almost surely, 2122001221202202 is an apocalyptic number.
122001221202202 is a deficient number, since it is larger than the sum of its proper divisors (61000610601104).
122001221202202 is an equidigital number, since it uses as much as digits as its factorization.
122001221202202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61000610601103.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 122001221202202 its reverse (202202122100221), we get a palindrome (324203343302423).
The spelling of 122001221202202 in words is "one hundred twenty-two trillion, one billion, two hundred twenty-one million, two hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •