Base | Representation |
---|---|
bin | 1011000000011111100… |
… | …1101001000100101101 |
3 | 200002010110220212020120 |
4 | 2300013321221010231 |
5 | 11044244421040411 |
6 | 222513151235153 |
7 | 16443230633541 |
oct | 2600771510455 |
9 | 602113825216 |
10 | 189111111981 |
11 | 732243244a0 |
12 | 30798b18ab9 |
13 | 14aaa42907c |
14 | 921dc95a21 |
15 | 4dbc532106 |
hex | 2c07e6912d |
189111111981 has 32 divisors (see below), whose sum is σ = 284152872960. Its totient is φ = 110834001600.
The previous prime is 189111111967. The next prime is 189111111989.
189111111981 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 189111111981 - 213 = 189111103789 is a prime.
It is a super-2 number, since 2×1891111119812 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189111111989) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1337260 + ... + 1471898.
It is an arithmetic number, because the mean of its divisors is an integer number (8879777280).
Almost surely, 2189111111981 is an apocalyptic number.
189111111981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
189111111981 is a deficient number, since it is larger than the sum of its proper divisors (95041760979).
189111111981 is a wasteful number, since it uses less digits than its factorization.
189111111981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136057.
The product of its digits is 5184, while the sum is 42.
The spelling of 189111111981 in words is "one hundred eighty-nine billion, one hundred eleven million, one hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •