Base | Representation |
---|---|
bin | 10110100100011… |
… | …01010110000111 |
3 | 111012020120211022 |
4 | 23102031112013 |
5 | 341431311011 |
6 | 30441501355 |
7 | 4456134011 |
oct | 1322152607 |
9 | 435216738 |
10 | 189322631 |
11 | 9795a993 |
12 | 534a185b |
13 | 302b9334 |
14 | 1b2031b1 |
15 | 1194a8db |
hex | b48d587 |
189322631 has 8 divisors (see below), whose sum is σ = 201811200. Its totient is φ = 177086520.
The previous prime is 189322621. The next prime is 189322633. The reversal of 189322631 is 136223981.
189322631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 189322631 - 210 = 189321607 is a prime.
It is a super-2 number, since 2×1893226312 = 71686117217524322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 189322591 and 189322600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189322633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61565 + ... + 64566.
It is an arithmetic number, because the mean of its divisors is an integer number (25226400).
Almost surely, 2189322631 is an apocalyptic number.
189322631 is a deficient number, since it is larger than the sum of its proper divisors (12488569).
189322631 is a wasteful number, since it uses less digits than its factorization.
189322631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126229.
The product of its digits is 15552, while the sum is 35.
The square root of 189322631 is about 13759.4560575627. The cubic root of 189322631 is about 574.2057146487.
The spelling of 189322631 in words is "one hundred eighty-nine million, three hundred twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •