Base | Representation |
---|---|
bin | 10110100011100… |
… | …00001100000000 |
3 | 111012000111222221 |
4 | 23101300030000 |
5 | 341414000300 |
6 | 30435140424 |
7 | 4455125554 |
oct | 1321601400 |
9 | 435014887 |
10 | 189203200 |
11 | 9788918a |
12 | 53444714 |
13 | 30276b74 |
14 | 1b1b1864 |
15 | 1192531a |
hex | b470300 |
189203200 has 216 divisors, whose sum is σ = 520091712. Its totient is φ = 67829760.
The previous prime is 189203191. The next prime is 189203207. The reversal of 189203200 is 2302981.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (189203207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4025577 + ... + 4025623.
It is an arithmetic number, because the mean of its divisors is an integer number (2407832).
Almost surely, 2189203200 is an apocalyptic number.
189203200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 189203200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260045856).
189203200 is an abundant number, since it is smaller than the sum of its proper divisors (330888512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189203200 is a wasteful number, since it uses less digits than its factorization.
189203200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 189203200 is about 13755.1154120931. The cubic root of 189203200 is about 574.0849465753.
The spelling of 189203200 in words is "one hundred eighty-nine million, two hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •