Base | Representation |
---|---|
bin | 101101111011101010100010… |
… | …000001100100110110001010 |
3 | 222111021011211020222101020202 |
4 | 231323222202001210312022 |
5 | 202434232001242401442 |
6 | 1553351043403452202 |
7 | 60356620613202341 |
oct | 5573524201446612 |
9 | 874234736871222 |
10 | 202012210122122 |
11 | 59404996191654 |
12 | 1a7a73a0527062 |
13 | 889489237738a |
14 | 37c562bd8ab58 |
15 | 1854c03e95c32 |
hex | b7baa2064d8a |
202012210122122 has 4 divisors (see below), whose sum is σ = 303018315183186. Its totient is φ = 101006105061060.
The previous prime is 202012210122097. The next prime is 202012210122127. The reversal of 202012210122122 is 221221012210202.
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., 199353813571441 + 2658396550681 = 14119271^2 + 1630459^2 .
It is a junction number, because it is equal to n+sod(n) for n = 202012210122094 and 202012210122103.
It is not an unprimeable number, because it can be changed into a prime (202012210122127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50503052530529 + ... + 50503052530532.
Almost surely, 2202012210122122 is an apocalyptic number.
202012210122122 is a deficient number, since it is larger than the sum of its proper divisors (101006105061064).
202012210122122 is a wasteful number, since it uses less digits than its factorization.
202012210122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101006105061063.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 202012210122122 its reverse (221221012210202), we get a palindrome (423233222332324).
The spelling of 202012210122122 in words is "two hundred two trillion, twelve billion, two hundred ten million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •