Base | Representation |
---|---|
bin | 11001010010001110000011… |
… | …111001010011111101111111 |
3 | 112120201220220222111200020022 |
4 | 121102032003321103331333 |
5 | 104033423134020200111 |
6 | 1032302014441242355 |
7 | 32265111144233351 |
oct | 3122160371237577 |
9 | 476656828450208 |
10 | 111203211100031 |
11 | 32484020671266 |
12 | 1057bb164933bb |
13 | 4a08557c1314b |
14 | 1d6639ab030d1 |
15 | ccc9b62902db |
hex | 652383e53f7f |
111203211100031 has 2 divisors, whose sum is σ = 111203211100032. Its totient is φ = 111203211100030.
The previous prime is 111203211099977. The next prime is 111203211100049. The reversal of 111203211100031 is 130001112302111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111203211100031 is a prime.
It is a super-2 number, since 2×1112032111000312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111203211099982 and 111203211100009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111203211100831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55601605550015 + 55601605550016.
It is an arithmetic number, because the mean of its divisors is an integer number (55601605550016).
Almost surely, 2111203211100031 is an apocalyptic number.
111203211100031 is a deficient number, since it is larger than the sum of its proper divisors (1).
111203211100031 is an equidigital number, since it uses as much as digits as its factorization.
111203211100031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 111203211100031 its reverse (130001112302111), we get a palindrome (241204323402142).
The spelling of 111203211100031 in words is "one hundred eleven trillion, two hundred three billion, two hundred eleven million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •