Base | Representation |
---|---|
bin | 10011001010000… |
… | …10111100011010 |
3 | 102012101201122022 |
4 | 21211002330122 |
5 | 312120100310 |
6 | 23540254442 |
7 | 3660660401 |
oct | 1145027432 |
9 | 365351568 |
10 | 160706330 |
11 | 82795054 |
12 | 459a1422 |
13 | 273aa105 |
14 | 174b4638 |
15 | e196a55 |
hex | 9942f1a |
160706330 has 32 divisors (see below), whose sum is σ = 296833680. Its totient is φ = 62622720.
The previous prime is 160706327. The next prime is 160706333. The reversal of 160706330 is 33607061.
It is a Cunningham number, because it is equal to 126772+1.
It is an interprime number because it is at equal distance from previous prime (160706327) and next prime (160706333).
It can be written as a sum of positive squares in 8 ways, for example, as 86694721 + 74011609 = 9311^2 + 8603^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 160706330.
It is not an unprimeable number, because it can be changed into a prime (160706333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65282 + ... + 67698.
Almost surely, 2160706330 is an apocalyptic number.
160706330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
160706330 is a deficient number, since it is larger than the sum of its proper divisors (136127350).
160706330 is a wasteful number, since it uses less digits than its factorization.
160706330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2594.
The product of its (nonzero) digits is 2268, while the sum is 26.
The square root of 160706330 is about 12677.0000394415. Note that the first 4 decimals coincide. The cubic root of 160706330 is about 543.6812150626.
The spelling of 160706330 in words is "one hundred sixty million, seven hundred six thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •