Base | Representation |
---|---|
bin | 10011001110100… |
… | …10011111011101 |
3 | 102020111121012000 |
4 | 21213102133131 |
5 | 312242404201 |
6 | 24001032513 |
7 | 3665656530 |
oct | 1147223735 |
9 | 366447160 |
10 | 161294301 |
11 | 83056883 |
12 | 46025739 |
13 | 2755491c |
14 | 175c8a17 |
15 | e260d86 |
hex | 99d27dd |
161294301 has 32 divisors (see below), whose sum is σ = 274725120. Its totient is φ = 91616832.
The previous prime is 161294299. The next prime is 161294383. The reversal of 161294301 is 103492161.
161294301 is a `hidden beast` number, since 1 + 612 + 9 + 43 + 0 + 1 = 666.
It is not a de Polignac number, because 161294301 - 21 = 161294299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161294501) 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, 30231 + ... + 35163.
It is an arithmetic number, because the mean of its divisors is an integer number (8585160).
Almost surely, 2161294301 is an apocalyptic number.
It is an amenable number.
161294301 is a deficient number, since it is larger than the sum of its proper divisors (113430819).
161294301 is a wasteful number, since it uses less digits than its factorization.
161294301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5122 (or 5116 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 161294301 is about 12700.1693295798. The cubic root of 161294301 is about 544.3434576436.
The spelling of 161294301 in words is "one hundred sixty-one million, two hundred ninety-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •