Base | Representation |
---|---|
bin | 111000110111110110… |
… | …0110100001001111111 |
3 | 102200020122222111000211 |
4 | 1301233230310021333 |
5 | 4000112033300411 |
6 | 132035052133251 |
7 | 11552400151156 |
oct | 1615754641177 |
9 | 380218874024 |
10 | 122133103231 |
11 | 47883a53157 |
12 | 1b806167227 |
13 | b6950c5829 |
14 | 5ca876c59d |
15 | 329c3ab221 |
hex | 1c6fb3427f |
122133103231 has 4 divisors (see below), whose sum is σ = 122141571552. Its totient is φ = 122124634912.
The previous prime is 122133103219. The next prime is 122133103237. The reversal of 122133103231 is 132301331221.
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 122133103231 - 25 = 122133103199 is a prime.
It is a super-2 number, since 2×1221331032312 (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 (122133103237) 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, 4212490 + ... + 4241383.
It is an arithmetic number, because the mean of its divisors is an integer number (30535392888).
Almost surely, 2122133103231 is an apocalyptic number.
122133103231 is a deficient number, since it is larger than the sum of its proper divisors (8468321).
122133103231 is an equidigital number, since it uses as much as digits as its factorization.
122133103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8468320.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 122133103231 its reverse (132301331221), we get a palindrome (254434434452).
The spelling of 122133103231 in words is "one hundred twenty-two billion, one hundred thirty-three million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •