Base | Representation |
---|---|
bin | 1011000010100010010… |
… | …1111011100001101001 |
3 | 200010112200222120111022 |
4 | 2300220211323201221 |
5 | 11101410323432214 |
6 | 223043423142225 |
7 | 16462640640161 |
oct | 2605045734151 |
9 | 603480876438 |
10 | 189659592809 |
11 | 73485994235 |
12 | 30910744975 |
13 | 14b66c56c3b |
14 | 9272a6b5a1 |
15 | 4e00774d8e |
hex | 2c2897b869 |
189659592809 has 4 divisors (see below), whose sum is σ = 190269431040. Its totient is φ = 189049754580.
The previous prime is 189659592757. The next prime is 189659592821. The reversal of 189659592809 is 908295956981.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 908295956981 = 7 ⋅129756565283.
It is a cyclic number.
It is not a de Polignac number, because 189659592809 - 28 = 189659592553 is a prime.
It is a super-2 number, since 2×1896595928092 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (189659592209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 304918649 + ... + 304919270.
It is an arithmetic number, because the mean of its divisors is an integer number (47567357760).
Almost surely, 2189659592809 is an apocalyptic number.
It is an amenable number.
189659592809 is a deficient number, since it is larger than the sum of its proper divisors (609838231).
189659592809 is an equidigital number, since it uses as much as digits as its factorization.
189659592809 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 609838230.
The product of its (nonzero) digits is 125971200, while the sum is 71.
The spelling of 189659592809 in words is "one hundred eighty-nine billion, six hundred fifty-nine million, five hundred ninety-two thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •