Base | Representation |
---|---|
bin | 1001100010111111001… |
… | …0000110100001100011 |
3 | 120200100011112121102222 |
4 | 2120233302012201203 |
5 | 10141343131422243 |
6 | 203202332301255 |
7 | 14564221366511 |
oct | 2305762064143 |
9 | 520304477388 |
10 | 164010420323 |
11 | 63613674322 |
12 | 2795291182b |
13 | 1260a0992b9 |
14 | 7d1c3bb4b1 |
15 | 43edac0168 |
hex | 262fc86863 |
164010420323 has 4 divisors (see below), whose sum is σ = 164011230288. Its totient is φ = 164009610360.
The previous prime is 164010420281. The next prime is 164010420341. The reversal of 164010420323 is 323024010461.
It is a Cunningham number, because it is equal to 4049822-1.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 164010420323 - 214 = 164010403939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164010420292 and 164010420301.
It is not an unprimeable number, because it can be changed into a prime (164010420383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 202490 + ... + 607472.
It is an arithmetic number, because the mean of its divisors is an integer number (41002807572).
Almost surely, 2164010420323 is an apocalyptic number.
164010420323 is a deficient number, since it is larger than the sum of its proper divisors (809965).
164010420323 is an equidigital number, since it uses as much as digits as its factorization.
164010420323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 809964.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 164010420323 its reverse (323024010461), we get a palindrome (487034430784).
The spelling of 164010420323 in words is "one hundred sixty-four billion, ten million, four hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •