Base | Representation |
---|---|
bin | 1110100100011… |
… | …01001100001011 |
3 | 22111222001220021 |
4 | 13102031030023 |
5 | 222241310011 |
6 | 20043241311 |
7 | 3012536335 |
oct | 722151413 |
9 | 274861807 |
10 | 122213131 |
11 | 62a93597 |
12 | 34b19237 |
13 | 1c420381 |
14 | 12334455 |
15 | aae1471 |
hex | 748d30b |
122213131 has 8 divisors (see below), whose sum is σ = 125521200. Its totient is φ = 118946400.
The previous prime is 122213123. The next prime is 122213173. The reversal of 122213131 is 131312221.
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 122213131 - 23 = 122213123 is a prime.
It is a super-3 number, since 3×1222131313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a plaindrome in base 14.
It is not an unprimeable number, because it can be changed into a prime (122213431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4296 + ... + 16213.
It is an arithmetic number, because the mean of its divisors is an integer number (15690150).
Almost surely, 2122213131 is an apocalyptic number.
122213131 is a deficient number, since it is larger than the sum of its proper divisors (3308069).
122213131 is a wasteful number, since it uses less digits than its factorization.
122213131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20669.
The product of its digits is 72, while the sum is 16.
The square root of 122213131 is about 11055.0047942097. The cubic root of 122213131 is about 496.2562127442.
Adding to 122213131 its reverse (131312221), we get a palindrome (253525352).
The spelling of 122213131 in words is "one hundred twenty-two million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •