Base | Representation |
---|---|
bin | 111000110111110110… |
… | …0100000011000001101 |
3 | 102200020122211100220110 |
4 | 1301233230200120031 |
5 | 4000112023202341 |
6 | 132035050310233 |
7 | 11552366363040 |
oct | 1615754403015 |
9 | 380218740813 |
10 | 122133022221 |
11 | 478839a8301 |
12 | 1b806128379 |
13 | b6950979b2 |
14 | 5ca874ac57 |
15 | 329c392216 |
hex | 1c6fb2060d |
122133022221 has 8 divisors (see below), whose sum is σ = 186107462464. Its totient is φ = 69790298400.
The previous prime is 122133022199. The next prime is 122133022279. The reversal of 122133022221 is 122220331221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122133022221 - 215 = 122132989453 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5815858201 = 122133022221 / (1 + 2 + 2 + 1 + 3 + 3 + 0 + 2 + 2 + 2 + 2 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122133026221) 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, 2907929080 + ... + 2907929121.
It is an arithmetic number, because the mean of its divisors is an integer number (23263432808).
Almost surely, 2122133022221 is an apocalyptic number.
It is an amenable number.
122133022221 is a deficient number, since it is larger than the sum of its proper divisors (63974440243).
122133022221 is an equidigital number, since it uses as much as digits as its factorization.
122133022221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5815858211.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 122133022221 its reverse (122220331221), we get a palindrome (244353353442).
The spelling of 122133022221 in words is "one hundred twenty-two billion, one hundred thirty-three million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •