Base | Representation |
---|---|
bin | 10110100101110… |
… | …01100000001101 |
3 | 111012120202221012 |
4 | 23102321200031 |
5 | 342003103001 |
6 | 30445415005 |
7 | 4460516225 |
oct | 1322714015 |
9 | 435522835 |
10 | 189503501 |
11 | 97a73870 |
12 | 5356a465 |
13 | 30350765 |
14 | 1b24d085 |
15 | 119842bb |
hex | b4b980d |
189503501 has 4 divisors (see below), whose sum is σ = 206731104. Its totient is φ = 172275900.
The previous prime is 189503497. The next prime is 189503507. The reversal of 189503501 is 105305981.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 189503501 - 22 = 189503497 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189503507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8613785 + ... + 8613806.
It is an arithmetic number, because the mean of its divisors is an integer number (51682776).
Almost surely, 2189503501 is an apocalyptic number.
189503501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
189503501 is a deficient number, since it is larger than the sum of its proper divisors (17227603).
189503501 is a wasteful number, since it uses less digits than its factorization.
189503501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17227602.
The product of its (nonzero) digits is 5400, while the sum is 32.
The square root of 189503501 is about 13766.0270593952. The cubic root of 189503501 is about 574.3885128899.
The spelling of 189503501 in words is "one hundred eighty-nine million, five hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •