Base | Representation |
---|---|
bin | 111000111100110100… |
… | …1111110111100001101 |
3 | 102200200022021110222111 |
4 | 1301321221332330031 |
5 | 4000432313230013 |
6 | 132103420144021 |
7 | 11556465656623 |
oct | 1617151767415 |
9 | 380608243874 |
10 | 122300133133 |
11 | 4795a2671a2 |
12 | 1b852098011 |
13 | b6c08a7ca9 |
14 | 5cc2a0b513 |
15 | 32abda173d |
hex | 1c79a7ef0d |
122300133133 has 4 divisors (see below), whose sum is σ = 122301698688. Its totient is φ = 122298567580.
The previous prime is 122300133121. The next prime is 122300133161. The reversal of 122300133133 is 331331003221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122300133133 - 29 = 122300132621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122300130133) 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, 659083 + ... + 824008.
It is an arithmetic number, because the mean of its divisors is an integer number (30575424672).
Almost surely, 2122300133133 is an apocalyptic number.
It is an amenable number.
122300133133 is a deficient number, since it is larger than the sum of its proper divisors (1565555).
122300133133 is an equidigital number, since it uses as much as digits as its factorization.
122300133133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1565554.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 122300133133 its reverse (331331003221), we get a palindrome (453631136354).
The spelling of 122300133133 in words is "one hundred twenty-two billion, three hundred million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •