Base | Representation |
---|---|
bin | 10011100110101… |
… | …10001100100001 |
3 | 102110110012010101 |
4 | 21303112030201 |
5 | 314100031301 |
6 | 24152502401 |
7 | 4034563141 |
oct | 1163261441 |
9 | 373405111 |
10 | 164455201 |
11 | 84915699 |
12 | 470aaa01 |
13 | 280c0591 |
14 | 17bac921 |
15 | e687701 |
hex | 9cd6321 |
164455201 has 4 divisors (see below), whose sum is σ = 170126100. Its totient is φ = 158784304.
The previous prime is 164455189. The next prime is 164455231. The reversal of 164455201 is 102554461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 86044176 + 78411025 = 9276^2 + 8855^2 .
It is a cyclic number.
It is not a de Polignac number, because 164455201 - 211 = 164453153 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 164455201.
It is not an unprimeable number, because it can be changed into a prime (164455231) 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 3 ways as a sum of consecutive naturals, for example, 2835406 + ... + 2835463.
It is an arithmetic number, because the mean of its divisors is an integer number (42531525).
Almost surely, 2164455201 is an apocalyptic number.
It is an amenable number.
164455201 is a deficient number, since it is larger than the sum of its proper divisors (5670899).
164455201 is an equidigital number, since it uses as much as digits as its factorization.
164455201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5670898.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 164455201 is about 12824.0087726108. The cubic root of 164455201 is about 547.8763296059.
The spelling of 164455201 in words is "one hundred sixty-four million, four hundred fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •