Base | Representation |
---|---|
bin | 1001100100100101111… |
… | …0100111110010010101 |
3 | 120201110012201210210212 |
4 | 2121021132213302111 |
5 | 10143234012140201 |
6 | 203313212255205 |
7 | 14611004603621 |
oct | 2311136476225 |
9 | 521405653725 |
10 | 164441521301 |
11 | 63814a51922 |
12 | 27a53171505 |
13 | 126784a9a35 |
14 | 7d5d75a181 |
15 | 4426878abb |
hex | 26497a7c95 |
164441521301 has 2 divisors, whose sum is σ = 164441521302. Its totient is φ = 164441521300.
The previous prime is 164441521291. The next prime is 164441521319. The reversal of 164441521301 is 103125144461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 142121460100 + 22320061201 = 376990^2 + 149399^2 .
It is an emirp because it is prime and its reverse (103125144461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 164441521301 - 210 = 164441520277 is a prime.
It is a super-3 number, since 3×1644415213013 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (164441521351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82220760650 + 82220760651.
It is an arithmetic number, because the mean of its divisors is an integer number (82220760651).
Almost surely, 2164441521301 is an apocalyptic number.
It is an amenable number.
164441521301 is a deficient number, since it is larger than the sum of its proper divisors (1).
164441521301 is an equidigital number, since it uses as much as digits as its factorization.
164441521301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 164441521301 its reverse (103125144461), we get a palindrome (267566665762).
The spelling of 164441521301 in words is "one hundred sixty-four billion, four hundred forty-one million, five hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •