Base | Representation |
---|---|
bin | 1001101001110101011… |
… | …1111000000110010001 |
3 | 120212002022020010110020 |
4 | 2122131113320012101 |
5 | 10204124323223444 |
6 | 204105012254053 |
7 | 14660615400525 |
oct | 2323527700621 |
9 | 525068203406 |
10 | 165849039249 |
11 | 643775059a3 |
12 | 28186611329 |
13 | 12840c8b3aa |
14 | 8054667d85 |
15 | 44aa206119 |
hex | 269d5f8191 |
165849039249 has 8 divisors (see below), whose sum is σ = 224757168192. Its totient is φ = 108753468240.
The previous prime is 165849039227. The next prime is 165849039283. The reversal of 165849039249 is 942930948561.
165849039249 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 not a de Polignac number, because 165849039249 - 27 = 165849039121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 165849039192 and 165849039201.
It is not an unprimeable number, because it can be changed into a prime (165849039299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 453139269 + ... + 453139634.
It is an arithmetic number, because the mean of its divisors is an integer number (28094646024).
Almost surely, 2165849039249 is an apocalyptic number.
It is an amenable number.
165849039249 is a deficient number, since it is larger than the sum of its proper divisors (58908128943).
165849039249 is an equidigital number, since it uses as much as digits as its factorization.
165849039249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906278967.
The product of its (nonzero) digits is 16796160, while the sum is 60.
The spelling of 165849039249 in words is "one hundred sixty-five billion, eight hundred forty-nine million, thirty-nine thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •