Base | Representation |
---|---|
bin | 10011000110110… |
… | …00011100101001 |
3 | 102011120120021102 |
4 | 21203120130221 |
5 | 312012120441 |
6 | 23523051145 |
7 | 3654162554 |
oct | 1143303451 |
9 | 364516242 |
10 | 160270121 |
11 | 82517350 |
12 | 45810ab5 |
13 | 272866bb |
14 | 173dd69b |
15 | e10c69b |
hex | 98d8729 |
160270121 has 8 divisors (see below), whose sum is σ = 175440384. Its totient is φ = 145199920.
The previous prime is 160270109. The next prime is 160270139. The reversal of 160270121 is 121072061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-160270121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 160270093 and 160270102.
It is not an unprimeable number, because it can be changed into a prime (160270171) 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 7 ways as a sum of consecutive naturals, for example, 21641 + ... + 28086.
It is an arithmetic number, because the mean of its divisors is an integer number (21930048).
Almost surely, 2160270121 is an apocalyptic number.
160270121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
160270121 is a deficient number, since it is larger than the sum of its proper divisors (15170263).
160270121 is a wasteful number, since it uses less digits than its factorization.
160270121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50031.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 160270121 is about 12659.7836079453. The cubic root of 160270121 is about 543.1888603881.
The spelling of 160270121 in words is "one hundred sixty million, two hundred seventy thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •