Base | Representation |
---|---|
bin | 111000111010110001… |
… | …0011000010110111111 |
3 | 102200111111020201222210 |
4 | 1301311202120112333 |
5 | 4000312120444411 |
6 | 132052511111503 |
7 | 11554666423431 |
oct | 1616542302677 |
9 | 380444221883 |
10 | 122231031231 |
11 | 47924259991 |
12 | 1b832b12593 |
13 | b6ac4921aa |
14 | 5cb7780651 |
15 | 32a5ca1ca6 |
hex | 1c758985bf |
122231031231 has 4 divisors (see below), whose sum is σ = 162974708312. Its totient is φ = 81487354152.
The previous prime is 122231031229. The next prime is 122231031323. The reversal of 122231031231 is 132130132221.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 122231031231 - 21 = 122231031229 is a prime.
It is a super-2 number, since 2×1222310312312 (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 = 122231031198 and 122231031207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122231033231) 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, 20371838536 + ... + 20371838541.
It is an arithmetic number, because the mean of its divisors is an integer number (40743677078).
Almost surely, 2122231031231 is an apocalyptic number.
122231031231 is a deficient number, since it is larger than the sum of its proper divisors (40743677081).
122231031231 is an equidigital number, since it uses as much as digits as its factorization.
122231031231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40743677080.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122231031231 its reverse (132130132221), we get a palindrome (254361163452).
The spelling of 122231031231 in words is "one hundred twenty-two billion, two hundred thirty-one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •