Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0010010000101100001 |
3 | 102200102101222011000221 |
4 | 1301303300102011201 |
5 | 4000231441333441 |
6 | 132045522043041 |
7 | 11554154251102 |
oct | 1616360220541 |
9 | 380371864027 |
10 | 122201121121 |
11 | 4790938aa92 |
12 | 1b824aa9481 |
13 | b6a621c0c1 |
14 | 5cb37d63a9 |
15 | 32a33448d1 |
hex | 1c73c12161 |
122201121121 has 8 divisors (see below), whose sum is σ = 124087327488. Its totient is φ = 120319500000.
The previous prime is 122201121079. The next prime is 122201121157. The reversal of 122201121121 is 121121102221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122201121121 - 215 = 122201088353 is a prime.
It is a super-2 number, since 2×1222011211212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122201121095 and 122201121104.
It is not an unprimeable number, because it can be changed into a prime (122201124121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1092580 + ... + 1199221.
It is an arithmetic number, because the mean of its divisors is an integer number (15510915936).
Almost surely, 2122201121121 is an apocalyptic number.
It is an amenable number.
122201121121 is a deficient number, since it is larger than the sum of its proper divisors (1886206367).
122201121121 is an equidigital number, since it uses as much as digits as its factorization.
122201121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2292623.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122201121121 its reverse (121121102221), we get a palindrome (243322223342).
The spelling of 122201121121 in words is "one hundred twenty-two billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •