Base | Representation |
---|---|
bin | 11001010011111110101111… |
… | …100101010001110010000101 |
3 | 112121011111020010100122000001 |
4 | 121103332233211101302011 |
5 | 104042413432000124424 |
6 | 1032433344412321301 |
7 | 32306623350433363 |
oct | 3123765745216205 |
9 | 477144203318001 |
10 | 111324203129989 |
11 | 325203694a6153 |
12 | 1059b462473231 |
13 | 4a16a9a7a6a95 |
14 | 1d6c197ac0633 |
15 | cd0be83a0844 |
hex | 653faf951c85 |
111324203129989 has 2 divisors, whose sum is σ = 111324203129990. Its totient is φ = 111324203129988.
The previous prime is 111324203129983. The next prime is 111324203130079. The reversal of 111324203129989 is 989921302423111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76016340000225 + 35307863129764 = 8718735^2 + 5942042^2 .
It is a cyclic number.
It is not a de Polignac number, because 111324203129989 - 23 = 111324203129981 is a prime.
It is a super-2 number, since 2×1113242031299892 (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 (111324203129981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55662101564994 + 55662101564995.
It is an arithmetic number, because the mean of its divisors is an integer number (55662101564995).
Almost surely, 2111324203129989 is an apocalyptic number.
It is an amenable number.
111324203129989 is a deficient number, since it is larger than the sum of its proper divisors (1).
111324203129989 is an equidigital number, since it uses as much as digits as its factorization.
111324203129989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1679616, while the sum is 55.
The spelling of 111324203129989 in words is "one hundred eleven trillion, three hundred twenty-four billion, two hundred three million, one hundred twenty-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •