Base | Representation |
---|---|
bin | 10011100101100… |
… | …10000100010111 |
3 | 102110011200010201 |
4 | 21302302010113 |
5 | 314030312343 |
6 | 24145401331 |
7 | 4033405543 |
oct | 1162620427 |
9 | 373150121 |
10 | 164307223 |
11 | 848244a3 |
12 | 47039247 |
13 | 2806b112 |
14 | 17b70a23 |
15 | e65894d |
hex | 9cb2117 |
164307223 has 8 divisors (see below), whose sum is σ = 169879680. Its totient is φ = 158751840.
The previous prime is 164307211. The next prime is 164307229. The reversal of 164307223 is 322703461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 164307223 - 25 = 164307191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164307191 and 164307200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164307229) 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, 17073 + ... + 24901.
It is an arithmetic number, because the mean of its divisors is an integer number (21234960).
Almost surely, 2164307223 is an apocalyptic number.
164307223 is a deficient number, since it is larger than the sum of its proper divisors (5572457).
164307223 is an equidigital number, since it uses as much as digits as its factorization.
164307223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8537.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 164307223 is about 12818.2379054221. The cubic root of 164307223 is about 547.7119525759.
It can be divided in two parts, 16430 and 7223, that added together give a triangular number (23653 = T217).
The spelling of 164307223 in words is "one hundred sixty-four million, three hundred seven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •