Base | Representation |
---|---|
bin | 10110100011110… |
… | …11101011111101 |
3 | 111012002220121102 |
4 | 23101323223331 |
5 | 341422002201 |
6 | 30440142445 |
7 | 4455413102 |
oct | 1321735375 |
9 | 435086542 |
10 | 189250301 |
11 | 97910609 |
12 | 53467a25 |
13 | 30292436 |
14 | 1b1c4aa9 |
15 | 1193426b |
hex | b47bafd |
189250301 has 8 divisors (see below), whose sum is σ = 199107384. Its totient is φ = 179642880.
The previous prime is 189250291. The next prime is 189250337. The reversal of 189250301 is 103052981.
It can be written as a sum of positive squares in 4 ways, for example, as 77968900 + 111281401 = 8830^2 + 10549^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 189250301 - 214 = 189233917 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189250351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60860 + ... + 63893.
It is an arithmetic number, because the mean of its divisors is an integer number (24888423).
Almost surely, 2189250301 is an apocalyptic number.
It is an amenable number.
189250301 is a deficient number, since it is larger than the sum of its proper divisors (9857083).
189250301 is a wasteful number, since it uses less digits than its factorization.
189250301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124831.
The product of its (nonzero) digits is 2160, while the sum is 29.
The square root of 189250301 is about 13756.8274322243. The cubic root of 189250301 is about 574.1325809557.
The spelling of 189250301 in words is "one hundred eighty-nine million, two hundred fifty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •