Base | Representation |
---|---|
bin | 11011110010010001110001… |
… | …010101101010011101001001 |
3 | 121000200102112011111001022101 |
4 | 123302101301111222131021 |
5 | 112004130313104310441 |
6 | 1111522544444553401 |
7 | 34511553120665116 |
oct | 3362216125523511 |
9 | 530612464431271 |
10 | 122202311010121 |
11 | 35a34788837311 |
12 | 11857762852861 |
13 | 5325822a0b904 |
14 | 22268a28d790d |
15 | e1db68901231 |
hex | 6f247156a749 |
122202311010121 has 4 divisors (see below), whose sum is σ = 122202525952512. Its totient is φ = 122202096067732.
The previous prime is 122202311010107. The next prime is 122202311010133. The reversal of 122202311010121 is 121010113202221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122202311010121 - 27 = 122202311009993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122202311010151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106616125 + ... + 107756218.
It is an arithmetic number, because the mean of its divisors is an integer number (30550631488128).
Almost surely, 2122202311010121 is an apocalyptic number.
It is an amenable number.
122202311010121 is a deficient number, since it is larger than the sum of its proper divisors (214942391).
122202311010121 is an equidigital number, since it uses as much as digits as its factorization.
122202311010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214942390.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 122202311010121 its reverse (121010113202221), we get a palindrome (243212424212342).
The spelling of 122202311010121 in words is "one hundred twenty-two trillion, two hundred two billion, three hundred eleven million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •