Base | Representation |
---|---|
bin | 10010110001111001… |
… | …111110001001110001 |
3 | 1221001022022111112201 |
4 | 102301321332021301 |
5 | 312244121230301 |
6 | 13132530023201 |
7 | 1312461361036 |
oct | 226171761161 |
9 | 57038274481 |
10 | 20164633201 |
11 | 8608456419 |
12 | 3aa9117b01 |
13 | 1b9482b22b |
14 | d940dd38d |
15 | 7d043b201 |
hex | 4b1e7e271 |
20164633201 has 2 divisors, whose sum is σ = 20164633202. Its totient is φ = 20164633200.
The previous prime is 20164633199. The next prime is 20164633277. The reversal of 20164633201 is 10233646102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19828864225 + 335768976 = 140815^2 + 18324^2 .
It is a cyclic number.
It is not a de Polignac number, because 20164633201 - 21 = 20164633199 is a prime.
It is a super-2 number, since 2×201646332012 (a number of 21 digits) contains 22 as substring.
Together with 20164633199, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20164633201.
It is not a weakly prime, because it can be changed into another prime (20164633501) 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 as a sum of consecutive naturals, namely, 10082316600 + 10082316601.
It is an arithmetic number, because the mean of its divisors is an integer number (10082316601).
Almost surely, 220164633201 is an apocalyptic number.
It is an amenable number.
20164633201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20164633201 is an equidigital number, since it uses as much as digits as its factorization.
20164633201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
The spelling of 20164633201 in words is "twenty billion, one hundred sixty-four million, six hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •