Base | Representation |
---|---|
bin | 111000111100111011… |
… | …0000111000101100111 |
3 | 102200200112020222212212 |
4 | 1301321312013011213 |
5 | 4000434121442411 |
6 | 132104012234035 |
7 | 11556535000262 |
oct | 1617166070547 |
9 | 380615228785 |
10 | 122303312231 |
11 | 47961038751 |
12 | 1b85316b91b |
13 | b6c144c009 |
14 | 5cc31d7cd9 |
15 | 32ac2cd68b |
hex | 1c79d87167 |
122303312231 has 4 divisors (see below), whose sum is σ = 122744840712. Its totient is φ = 121861783752.
The previous prime is 122303312213. The next prime is 122303312237. The reversal of 122303312231 is 132213303221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122303312231 - 214 = 122303295847 is a prime.
It is a super-2 number, since 2×1223033122312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122303312197 and 122303312206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122303312237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220763825 + ... + 220764378.
It is an arithmetic number, because the mean of its divisors is an integer number (30686210178).
Almost surely, 2122303312231 is an apocalyptic number.
122303312231 is a deficient number, since it is larger than the sum of its proper divisors (441528481).
122303312231 is an equidigital number, since it uses as much as digits as its factorization.
122303312231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441528480.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 122303312231 its reverse (132213303221), we get a palindrome (254516615452).
The spelling of 122303312231 in words is "one hundred twenty-two billion, three hundred three million, three hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •