Base | Representation |
---|---|
bin | 1010110101011101011… |
… | …0001000100010010001 |
3 | 122210111001012200012221 |
4 | 2231113112020202101 |
5 | 11022213121414044 |
6 | 221303215221041 |
7 | 16306642336414 |
oct | 2552726104221 |
9 | 583431180187 |
10 | 186149013649 |
11 | 71a442a1145 |
12 | 300b0b17781 |
13 | 14727855271 |
14 | 901c717b7b |
15 | 4c97478484 |
hex | 2b57588891 |
186149013649 has 4 divisors (see below), whose sum is σ = 186157921264. Its totient is φ = 186140106036.
The previous prime is 186149013569. The next prime is 186149013653. The reversal of 186149013649 is 946310941681.
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.
It is a cyclic number.
It is not a de Polignac number, because 186149013649 - 27 = 186149013521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 186149013596 and 186149013605.
It is not an unprimeable number, because it can be changed into a prime (186149013679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4422387 + ... + 4464280.
It is an arithmetic number, because the mean of its divisors is an integer number (46539480316).
Almost surely, 2186149013649 is an apocalyptic number.
It is an amenable number.
186149013649 is a deficient number, since it is larger than the sum of its proper divisors (8907615).
186149013649 is an equidigital number, since it uses as much as digits as its factorization.
186149013649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8907614.
The product of its (nonzero) digits is 1119744, while the sum is 52.
The spelling of 186149013649 in words is "one hundred eighty-six billion, one hundred forty-nine million, thirteen thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •