Base | Representation |
---|---|
bin | 11001010011101000011001… |
… | …000000101100111011111001 |
3 | 112121002012021110020010222022 |
4 | 121103220121000230323321 |
5 | 104042020303220414001 |
6 | 1032414335035404225 |
7 | 32305113523310153 |
oct | 3123503100547371 |
9 | 477065243203868 |
10 | 111300202123001 |
11 | 32511172565391 |
12 | 105968845b3675 |
13 | 4a147442172b8 |
14 | 1d6ad5c2a1ad3 |
15 | cd029126111b |
hex | 653a1902cef9 |
111300202123001 has 2 divisors, whose sum is σ = 111300202123002. Its totient is φ = 111300202123000.
The previous prime is 111300202122983. The next prime is 111300202123009. The reversal of 111300202123001 is 100321202003111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106563916080400 + 4736286042601 = 10322980^2 + 2176301^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111300202123001 is a prime.
It is not a weakly prime, because it can be changed into another prime (111300202123009) 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 as a sum of consecutive naturals, namely, 55650101061500 + 55650101061501.
It is an arithmetic number, because the mean of its divisors is an integer number (55650101061501).
Almost surely, 2111300202123001 is an apocalyptic number.
It is an amenable number.
111300202123001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111300202123001 is an equidigital number, since it uses as much as digits as its factorization.
111300202123001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 111300202123001 its reverse (100321202003111), we get a palindrome (211621404126112).
The spelling of 111300202123001 in words is "one hundred eleven trillion, three hundred billion, two hundred two million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •