Base | Representation |
---|---|
bin | 10110100100000… |
… | …00100001110000 |
3 | 111012010220210202 |
4 | 23102000201300 |
5 | 341423121003 |
6 | 30440414332 |
7 | 4455524645 |
oct | 1322004160 |
9 | 435126722 |
10 | 189270128 |
11 | 979244a3 |
12 | 534773a8 |
13 | 3029b478 |
14 | 1b1cbdcc |
15 | 1193a088 |
hex | b480870 |
189270128 has 80 divisors (see below), whose sum is σ = 404545536. Its totient is φ = 85493760.
The previous prime is 189270127. The next prime is 189270139. The reversal of 189270128 is 821072981.
189270128 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 189270091 and 189270100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189270121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 536000 + ... + 536352.
Almost surely, 2189270128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 189270128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202272768).
189270128 is an abundant number, since it is smaller than the sum of its proper divisors (215275408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189270128 is a wasteful number, since it uses less digits than its factorization.
189270128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462 (or 456 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 38.
The square root of 189270128 is about 13757.5480373503. The cubic root of 189270128 is about 574.1526301165.
The spelling of 189270128 in words is "one hundred eighty-nine million, two hundred seventy thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •