Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0101011000110001011 |
3 | 102200011111201001001002 |
4 | 1301231312223012023 |
5 | 4000031121230011 |
6 | 132032024245215 |
7 | 11551543002266 |
oct | 1615566530613 |
9 | 380144631032 |
10 | 122102133131 |
11 | 4786851a930 |
12 | 1b7b791080b |
13 | b68b871124 |
14 | 5ca45c9cdd |
15 | 32997dec3b |
hex | 1c6ddab18b |
122102133131 has 8 divisors (see below), whose sum is σ = 138993732864. Its totient is φ = 106175767720.
The previous prime is 122102133119. The next prime is 122102133137. The reversal of 122102133131 is 131331201221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122102133131 - 222 = 122097938827 is a prime.
It is a super-2 number, since 2×1221021331312 (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 (122102133137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241308311 + ... + 241308816.
It is an arithmetic number, because the mean of its divisors is an integer number (17374216608).
Almost surely, 2122102133131 is an apocalyptic number.
122102133131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122102133131 is a deficient number, since it is larger than the sum of its proper divisors (16891599733).
122102133131 is a wasteful number, since it uses less digits than its factorization.
122102133131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482617161.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 122102133131 its reverse (131331201221), we get a palindrome (253433334352).
The spelling of 122102133131 in words is "one hundred twenty-two billion, one hundred two million, one hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •