Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0010001001010010111 |
3 | 102200110000201210000222 |
4 | 1301310102101022113 |
5 | 4000241231431411 |
6 | 132050441024555 |
7 | 11554323055142 |
oct | 1616422211227 |
9 | 380400653028 |
10 | 122210030231 |
11 | 47913415593 |
12 | 1b827a8515b |
13 | b6a801b273 |
14 | 5cb4a75059 |
15 | 32a40044db |
hex | 1c74491297 |
122210030231 has 8 divisors (see below), whose sum is σ = 124548205824. Its totient is φ = 119873052000.
The previous prime is 122210030213. The next prime is 122210030237. The reversal of 122210030231 is 132030012221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122210030231 is a prime.
It is a super-2 number, since 2×1222100302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122210030237) 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, 91895 + ... + 502856.
It is an arithmetic number, because the mean of its divisors is an integer number (15568525728).
Almost surely, 2122210030231 is an apocalyptic number.
122210030231 is a deficient number, since it is larger than the sum of its proper divisors (2338175593).
122210030231 is an equidigital number, since it uses as much as digits as its factorization.
122210030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598681.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 122210030231 its reverse (132030012221), we get a palindrome (254240042452).
The spelling of 122210030231 in words is "one hundred twenty-two billion, two hundred ten million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •