Base | Representation |
---|---|
bin | 11011110000110011011010… |
… | …110011000001111101000001 |
3 | 121000022202000201000102201112 |
4 | 123300303122303001331001 |
5 | 112001000322240213441 |
6 | 1111404231530013105 |
7 | 34501335426656000 |
oct | 3360633263017501 |
9 | 530282021012645 |
10 | 122101001101121 |
11 | 359a581aa56199 |
12 | 1183bbaa277195 |
13 | 53190c8a04bb3 |
14 | 2221a118d6c37 |
15 | e1b1d96ba4eb |
hex | 6f0cdacc1f41 |
122101001101121 has 16 divisors (see below), whose sum is σ = 142397358662400. Its totient is φ = 104653943271360.
The previous prime is 122101001101099. The next prime is 122101001101151. The reversal of 122101001101121 is 121101100101221.
It is a de Polignac number, because none of the positive numbers 2k-122101001101121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122101001101096 and 122101001101105.
It is not an unprimeable number, because it can be changed into a prime (122101001101151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1975580 + ... + 15751346.
It is an arithmetic number, because the mean of its divisors is an integer number (8899834916400).
Almost surely, 2122101001101121 is an apocalyptic number.
It is an amenable number.
122101001101121 is a deficient number, since it is larger than the sum of its proper divisors (20296357561279).
122101001101121 is an equidigital number, since it uses as much as digits as its factorization.
122101001101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13801629 (or 13801615 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 122101001101121 its reverse (121101100101221), we get a palindrome (243202101202342).
The spelling of 122101001101121 in words is "one hundred twenty-two trillion, one hundred one billion, one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •