Base | Representation |
---|---|
bin | 11001010001000001101011… |
… | …110010010000101101110101 |
3 | 112120110002020122022220202021 |
4 | 121101001223302100231311 |
5 | 104031102210232014033 |
6 | 1032200213042313141 |
7 | 32256145660243345 |
oct | 3121015362205565 |
9 | 476402218286667 |
10 | 111121202219893 |
11 | 32452267802868 |
12 | 105680499587b1 |
13 | 4a008b8845078 |
14 | 1d6241b23ad25 |
15 | cca7b6757b2d |
hex | 65106bc90b75 |
111121202219893 has 2 divisors, whose sum is σ = 111121202219894. Its totient is φ = 111121202219892.
The previous prime is 111121202219837. The next prime is 111121202219941. The reversal of 111121202219893 is 398912202121111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66331137338449 + 44790064881444 = 8144393^2 + 6692538^2 .
It is a cyclic number.
It is not a de Polignac number, because 111121202219893 - 245 = 75936830131061 is a prime.
It is a super-2 number, since 2×1111212022198932 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111121202319893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55560601109946 + 55560601109947.
It is an arithmetic number, because the mean of its divisors is an integer number (55560601109947).
Almost surely, 2111121202219893 is an apocalyptic number.
It is an amenable number.
111121202219893 is a deficient number, since it is larger than the sum of its proper divisors (1).
111121202219893 is an equidigital number, since it uses as much as digits as its factorization.
111121202219893 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 43.
The spelling of 111121202219893 in words is "one hundred eleven trillion, one hundred twenty-one billion, two hundred two million, two hundred nineteen thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •