Base | Representation |
---|---|
bin | 1110100101001… |
… | …11010100000011 |
3 | 22112011111200020 |
4 | 13102213110003 |
5 | 222303221011 |
6 | 20045424523 |
7 | 3013463313 |
oct | 722472403 |
9 | 275144606 |
10 | 122320131 |
11 | 63056a1a |
12 | 34b6b143 |
13 | 1c459c9b |
14 | 12361443 |
15 | ab13006 |
hex | 74a7503 |
122320131 has 8 divisors (see below), whose sum is σ = 166170960. Its totient is φ = 80008032.
The previous prime is 122320123. The next prime is 122320147. The reversal of 122320131 is 131023221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122320131 - 23 = 122320123 is a prime.
It is a super-2 number, since 2×1223201312 = 29924428895714322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122320131.
It is not an unprimeable number, because it can be changed into a prime (122320111) 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, 384496 + ... + 384813.
It is an arithmetic number, because the mean of its divisors is an integer number (20771370).
Almost surely, 2122320131 is an apocalyptic number.
122320131 is a deficient number, since it is larger than the sum of its proper divisors (43850829).
122320131 is an equidigital number, since it uses as much as digits as its factorization.
122320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769365.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 122320131 is about 11059.8431724867. The cubic root of 122320131 is about 496.4009978568.
Adding to 122320131 its reverse (131023221), we get a palindrome (253343352).
The spelling of 122320131 in words is "one hundred twenty-two million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •