Base | Representation |
---|---|
bin | 111000111110000001… |
… | …1010011001100100011 |
3 | 102200210002220101122222 |
4 | 1301330003103030203 |
5 | 4001023110333011 |
6 | 132111413421255 |
7 | 11560464411554 |
oct | 1617403231443 |
9 | 380702811588 |
10 | 122340324131 |
11 | 4797aa182a3 |
12 | 1b86363a82b |
13 | b6c900a74c |
14 | 5cc80b032b |
15 | 32b068eddb |
hex | 1c7c0d3323 |
122340324131 has 8 divisors (see below), whose sum is σ = 125515769280. Its totient is φ = 119179893672.
The previous prime is 122340324091. The next prime is 122340324157. The reversal of 122340324131 is 131423043221.
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-122340324131 is a prime.
It is a super-2 number, since 2×1223403241312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122340324131.
It is not an unprimeable number, because it can be changed into a prime (122340324031) 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, 3737165 + ... + 3769758.
It is an arithmetic number, because the mean of its divisors is an integer number (15689471160).
Almost surely, 2122340324131 is an apocalyptic number.
122340324131 is a deficient number, since it is larger than the sum of its proper divisors (3175445149).
122340324131 is an equidigital number, since it uses as much as digits as its factorization.
122340324131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7507345.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 122340324131 its reverse (131423043221), we get a palindrome (253763367352).
The spelling of 122340324131 in words is "one hundred twenty-two billion, three hundred forty million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •