Base | Representation |
---|---|
bin | 111000111101011011… |
… | …0001010011100111111 |
3 | 102200201200212001210202 |
4 | 1301322312022130333 |
5 | 4001002421300411 |
6 | 132105412154115 |
7 | 11560130502524 |
oct | 1617266123477 |
9 | 380650761722 |
10 | 122320103231 |
11 | 4796a567007 |
12 | 1b85890893b |
13 | b6c4a7a911 |
14 | 5cc552914b |
15 | 32ad9e883b |
hex | 1c7ad8a73f |
122320103231 has 8 divisors (see below), whose sum is σ = 123750666864. Its totient is φ = 120893843200.
The previous prime is 122320103221. The next prime is 122320103233. The reversal of 122320103231 is 132301023221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122320103231 - 26 = 122320103167 is a prime.
It is a super-2 number, since 2×1223201032312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122320103233) 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 7 ways as a sum of consecutive naturals, for example, 1018706 + ... + 1132431.
It is an arithmetic number, because the mean of its divisors is an integer number (15468833358).
Almost surely, 2122320103231 is an apocalyptic number.
122320103231 is a deficient number, since it is larger than the sum of its proper divisors (1430563633).
122320103231 is a wasteful number, since it uses less digits than its factorization.
122320103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2151801.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122320103231 its reverse (132301023221), we get a palindrome (254621126452).
The spelling of 122320103231 in words is "one hundred twenty-two billion, three hundred twenty million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •