Base | Representation |
---|---|
bin | 111000110100001110… |
… | …0001011010101100101 |
3 | 102122221011210022002021 |
4 | 1301220130023111211 |
5 | 3444334343114341 |
6 | 132015021343141 |
7 | 11546360643235 |
oct | 1615034132545 |
9 | 378834708067 |
10 | 122011301221 |
11 | 47821220537 |
12 | 1b791407ab1 |
13 | b675aba634 |
14 | 5c96503cc5 |
15 | 329184b9d1 |
hex | 1c6870b565 |
122011301221 has 8 divisors (see below), whose sum is σ = 126256923000. Its totient is φ = 117768235200.
The previous prime is 122011301177. The next prime is 122011301257. The reversal of 122011301221 is 122103110221.
It can be written as a sum of positive squares in 4 ways, for example, as 729756196 + 121281545025 = 27014^2 + 348255^2 .
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 122011301221 - 213 = 122011293029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122011301195 and 122011301204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122011301921) 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, 541546 + ... + 733003.
It is an arithmetic number, because the mean of its divisors is an integer number (15782115375).
Almost surely, 2122011301221 is an apocalyptic number.
It is an amenable number.
122011301221 is a deficient number, since it is larger than the sum of its proper divisors (4245621779).
122011301221 is a wasteful number, since it uses less digits than its factorization.
122011301221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1277879.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 122011301221 its reverse (122103110221), we get a palindrome (244114411442).
The spelling of 122011301221 in words is "one hundred twenty-two billion, eleven million, three hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •