Base | Representation |
---|---|
bin | 10011001100010… |
… | …11001010101001 |
3 | 102012221202102201 |
4 | 21212023022221 |
5 | 312204032103 |
6 | 23550500201 |
7 | 3663332014 |
oct | 1146131251 |
9 | 365852381 |
10 | 161002153 |
11 | 82977334 |
12 | 45b04661 |
13 | 27481960 |
14 | 1755037b |
15 | e20451d |
hex | 998b2a9 |
161002153 has 8 divisors (see below), whose sum is σ = 173612096. Its totient is φ = 148424400.
The previous prime is 161002123. The next prime is 161002169. The reversal of 161002153 is 351200161.
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-161002153 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 161002153.
It is not an unprimeable number, because it can be changed into a prime (161002103) 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, 2908 + ... + 18178.
It is an arithmetic number, because the mean of its divisors is an integer number (21701512).
Almost surely, 2161002153 is an apocalyptic number.
161002153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
161002153 is a deficient number, since it is larger than the sum of its proper divisors (12609943).
161002153 is a wasteful number, since it uses less digits than its factorization.
161002153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16095.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 161002153 is about 12688.6623802511. The cubic root of 161002153 is about 544.0146074959.
The spelling of 161002153 in words is "one hundred sixty-one million, two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •