Base | Representation |
---|---|
bin | 1001100011000101010… |
… | …1011010000110111101 |
3 | 120200101222112012021200 |
4 | 2120301111122012331 |
5 | 10141421312442142 |
6 | 203205102250113 |
7 | 14564655562110 |
oct | 2306125320675 |
9 | 520358465250 |
10 | 164036452797 |
11 | 63627334968 |
12 | 2795b586939 |
13 | 126125b2429 |
14 | 7d21a36577 |
15 | 440101364c |
hex | 263155a1bd |
164036452797 has 24 divisors (see below), whose sum is σ = 275229527040. Its totient is φ = 92198472480.
The previous prime is 164036452781. The next prime is 164036452807. The reversal of 164036452797 is 797254630461.
164036452797 is a `hidden beast` number, since 1 + 6 + 4 + 0 + 364 + 5 + 279 + 7 = 666.
164036452797 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 164036452797 - 24 = 164036452781 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164036472797) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21338397 + ... + 21346082.
It is an arithmetic number, because the mean of its divisors is an integer number (11467896960).
Almost surely, 2164036452797 is an apocalyptic number.
It is an amenable number.
164036452797 is a deficient number, since it is larger than the sum of its proper divisors (111193074243).
164036452797 is a wasteful number, since it uses less digits than its factorization.
164036452797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42684553 (or 42684550 counting only the distinct ones).
The product of its (nonzero) digits is 7620480, while the sum is 54.
The spelling of 164036452797 in words is "one hundred sixty-four billion, thirty-six million, four hundred fifty-two thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •