Base | Representation |
---|---|
bin | 10110100110000… |
… | …10011110101110 |
3 | 111012122122101000 |
4 | 23103002132232 |
5 | 342010242040 |
6 | 30450301130 |
7 | 4461031353 |
oct | 1323023656 |
9 | 435578330 |
10 | 189540270 |
11 | 97a99457 |
12 | 535877a6 |
13 | 3036440a |
14 | 1b25c62a |
15 | 11990130 |
hex | b4c27ae |
189540270 has 64 divisors (see below), whose sum is σ = 519128640. Its totient is φ = 49175424.
The previous prime is 189540203. The next prime is 189540271. The reversal of 189540270 is 72045981.
189540270 is a `hidden beast` number, since 189 + 5 + 402 + 70 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189540271) 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, 504 + ... + 19476.
It is an arithmetic number, because the mean of its divisors is an integer number (8111385).
Almost surely, 2189540270 is an apocalyptic number.
189540270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 189540270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259564320).
189540270 is an abundant number, since it is smaller than the sum of its proper divisors (329588370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
189540270 is a wasteful number, since it uses less digits than its factorization.
189540270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19026 (or 19020 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 189540270 is about 13767.3624925038. The cubic root of 189540270 is about 574.4256596539.
The spelling of 189540270 in words is "one hundred eighty-nine million, five hundred forty thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •