Base | Representation |
---|---|
bin | 11011101111011111100111… |
… | …000010101010010111101010 |
3 | 121000000010202020001020010201 |
4 | 123233133213002222113222 |
5 | 111443012023111242302 |
6 | 1111255030223502414 |
7 | 34462001424020161 |
oct | 3357374702522752 |
9 | 530003666036121 |
10 | 122011012212202 |
11 | 35970641634013 |
12 | 11826675157a0a |
13 | 53107872a3129 |
14 | 221b51628c3d8 |
15 | e18bbe2d5c87 |
hex | 6ef7e70aa5ea |
122011012212202 has 8 divisors (see below), whose sum is σ = 183019189089312. Its totient is φ = 61004615849100.
The previous prime is 122011012212149. The next prime is 122011012212211. The reversal of 122011012212202 is 202212210110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1220110122122022 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122011012212202.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 444957174 + ... + 445231297.
It is an arithmetic number, because the mean of its divisors is an integer number (22877398636164).
Almost surely, 2122011012212202 is an apocalyptic number.
122011012212202 is a deficient number, since it is larger than the sum of its proper divisors (61008176877110).
122011012212202 is an equidigital number, since it uses as much as digits as its factorization.
122011012212202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890257004.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 122011012212202 its reverse (202212210110221), we get a palindrome (324223222322423).
The spelling of 122011012212202 in words is "one hundred twenty-two trillion, eleven billion, twelve million, two hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •