Base | Representation |
---|---|
bin | 1001011001100000000… |
… | …1111010111001001001 |
3 | 120102202201210220111202 |
4 | 2112120001322321021 |
5 | 10121134343231103 |
6 | 202101543033545 |
7 | 14444145003605 |
oct | 2263001727111 |
9 | 512681726452 |
10 | 161464430153 |
11 | 62527509214 |
12 | 2736213b8b5 |
13 | 122c2786940 |
14 | 7b5a1d8505 |
15 | 430030c988 |
hex | 259807ae49 |
161464430153 has 32 divisors (see below), whose sum is σ = 179330004000. Its totient is φ = 144429465600.
The previous prime is 161464430143. The next prime is 161464430161. The reversal of 161464430153 is 351034464161.
It can be written as a sum of positive squares in 16 ways, for example, as 25681024009 + 135783406144 = 160253^2 + 368488^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161464430153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161464430143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52269233 + ... + 52272321.
It is an arithmetic number, because the mean of its divisors is an integer number (5604062625).
Almost surely, 2161464430153 is an apocalyptic number.
161464430153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
161464430153 is a deficient number, since it is larger than the sum of its proper divisors (17865573847).
161464430153 is a wasteful number, since it uses less digits than its factorization.
161464430153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3773.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 161464430153 in words is "one hundred sixty-one billion, four hundred sixty-four million, four hundred thirty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •