Base | Representation |
---|---|
bin | 1001100110110000010… |
… | …1011010100011011011 |
3 | 120202221200020002002102 |
4 | 2121230011122203123 |
5 | 10200431130203214 |
6 | 203450552354015 |
7 | 14631254561663 |
oct | 2315405324333 |
9 | 522850202072 |
10 | 165022116059 |
11 | 63a927562a9 |
12 | 27b956a590b |
13 | 1273b86cb28 |
14 | 7db68d11a3 |
15 | 445c811bde |
hex | 266c15a8db |
165022116059 has 4 divisors (see below), whose sum is σ = 165052240560. Its totient is φ = 164991991560.
The previous prime is 165022116029. The next prime is 165022116097. The reversal of 165022116059 is 950611220561.
165022116059 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 950611220561 = 61 ⋅15583790501.
It is a cyclic number.
It is not a de Polignac number, because 165022116059 - 228 = 164753680603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165022116029) 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 3 ways as a sum of consecutive naturals, for example, 15054032 + ... + 15064989.
It is an arithmetic number, because the mean of its divisors is an integer number (41263060140).
Almost surely, 2165022116059 is an apocalyptic number.
165022116059 is a deficient number, since it is larger than the sum of its proper divisors (30124501).
165022116059 is an equidigital number, since it uses as much as digits as its factorization.
165022116059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30124500.
The product of its (nonzero) digits is 32400, while the sum is 38.
The spelling of 165022116059 in words is "one hundred sixty-five billion, twenty-two million, one hundred sixteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •