Base | Representation |
---|---|
bin | 111000111100110111… |
… | …0011011110110100011 |
3 | 102200200101110202210122 |
4 | 1301321232123312203 |
5 | 4000433113101011 |
6 | 132103501150455 |
7 | 11556511620143 |
oct | 1617156336643 |
9 | 380611422718 |
10 | 122301300131 |
11 | 4795a993a5a |
12 | 1b85255b42b |
13 | b6c0bc621a |
14 | 5cc2c32923 |
15 | 32ac0323db |
hex | 1c79b9bda3 |
122301300131 has 4 divisors (see below), whose sum is σ = 122357897064. Its totient is φ = 122244703200.
The previous prime is 122301300109. The next prime is 122301300139. The reversal of 122301300131 is 131003103221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122301300131 is a prime.
It is a super-2 number, since 2×1223013001312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122301300139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28295225 + ... + 28299546.
It is an arithmetic number, because the mean of its divisors is an integer number (30589474266).
Almost surely, 2122301300131 is an apocalyptic number.
122301300131 is a deficient number, since it is larger than the sum of its proper divisors (56596933).
122301300131 is an equidigital number, since it uses as much as digits as its factorization.
122301300131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56596932.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 122301300131 its reverse (131003103221), we get a palindrome (253304403352).
The spelling of 122301300131 in words is "one hundred twenty-two billion, three hundred one million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •