Base | Representation |
---|---|
bin | 10011000101001… |
… | …00000110001101 |
3 | 102011011200010122 |
4 | 21202210012031 |
5 | 311433240233 |
6 | 23514314325 |
7 | 3652310450 |
oct | 1142440615 |
9 | 364150118 |
10 | 160055693 |
11 | 82390236 |
12 | 457289a5 |
13 | 2720cc15 |
14 | 17385497 |
15 | e0b8d98 |
hex | 98a418d |
160055693 has 4 divisors (see below), whose sum is σ = 182920800. Its totient is φ = 137190588.
The previous prime is 160055683. The next prime is 160055699. The reversal of 160055693 is 396550061.
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: 396550061 = 23 ⋅17241307.
It is a cyclic number.
It is not a de Polignac number, because 160055693 - 216 = 159990157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160055699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11432543 + ... + 11432556.
It is an arithmetic number, because the mean of its divisors is an integer number (45730200).
Almost surely, 2160055693 is an apocalyptic number.
It is an amenable number.
160055693 is a deficient number, since it is larger than the sum of its proper divisors (22865107).
160055693 is an equidigital number, since it uses as much as digits as its factorization.
160055693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22865106.
The product of its (nonzero) digits is 24300, while the sum is 35.
The square root of 160055693 is about 12651.3119082568. The cubic root of 160055693 is about 542.9465052037.
The spelling of 160055693 in words is "one hundred sixty million, fifty-five thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •