Base | Representation |
---|---|
bin | 111001000000001010… |
… | …1001110011101101001 |
3 | 102200222010000121211010 |
4 | 1302000111032131221 |
5 | 4001200001212301 |
6 | 132122500454133 |
7 | 11562325645542 |
oct | 1620025163551 |
9 | 380863017733 |
10 | 122412132201 |
11 | 47a07503807 |
12 | 1b8836aa349 |
13 | b70ab60228 |
14 | 5cd38434c9 |
15 | 32b6b265d6 |
hex | 1c8054e769 |
122412132201 has 8 divisors (see below), whose sum is σ = 167197058784. Its totient is φ = 79617646880.
The previous prime is 122412132173. The next prime is 122412132223. The reversal of 122412132201 is 102231214221.
It is a happy number.
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 122412132201 - 29 = 122412131689 is a prime.
It is a super-2 number, since 2×1224121322012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122412132901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 497610171 + ... + 497610416.
It is an arithmetic number, because the mean of its divisors is an integer number (20899632348).
Almost surely, 2122412132201 is an apocalyptic number.
It is an amenable number.
122412132201 is a deficient number, since it is larger than the sum of its proper divisors (44784926583).
122412132201 is an equidigital number, since it uses as much as digits as its factorization.
122412132201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 995220631.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 122412132201 its reverse (102231214221), we get a palindrome (224643346422).
The spelling of 122412132201 in words is "one hundred twenty-two billion, four hundred twelve million, one hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •