Base | Representation |
---|---|
bin | 11001010010001011000101… |
… | …101100001111000101010111 |
3 | 112120201121200120220001110102 |
4 | 121102023011230033011113 |
5 | 104033400120110013421 |
6 | 1032300330045044315 |
7 | 32264636105315066 |
oct | 3122130554170527 |
9 | 476647616801412 |
10 | 111200020001111 |
11 | 32482733348428 |
12 | 1057b38585669b |
13 | 4a08169a6cc32 |
14 | 1d66176d941dd |
15 | ccc87b04e60b |
hex | 6522c5b0f157 |
111200020001111 has 2 divisors, whose sum is σ = 111200020001112. Its totient is φ = 111200020001110.
The previous prime is 111200020001101. The next prime is 111200020001117. The reversal of 111200020001111 is 111100020002111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111200020001111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111200020001092 and 111200020001101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111200020001117) 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, 55600010000555 + 55600010000556.
It is an arithmetic number, because the mean of its divisors is an integer number (55600010000556).
Almost surely, 2111200020001111 is an apocalyptic number.
111200020001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200020001111 is an equidigital number, since it uses as much as digits as its factorization.
111200020001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111200020001111 its reverse (111100020002111), we get a palindrome (222300040003222).
The spelling of 111200020001111 in words is "one hundred eleven trillion, two hundred billion, twenty million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •