Base | Representation |
---|---|
bin | 100101011010000110011001… |
… | …111110011011000111101101 |
3 | 210120112002020122202121102201 |
4 | 211122012121332123013231 |
5 | 133031004113210120331 |
6 | 1341524013330221501 |
7 | 46440162215311504 |
oct | 4532063176330755 |
9 | 716462218677381 |
10 | 164521305551341 |
11 | 48470103a16412 |
12 | 165513b8424891 |
13 | 70a53a594522b |
14 | 2c8ac3351b83b |
15 | 140489b616a61 |
hex | 95a199f9b1ed |
164521305551341 has 8 divisors (see below), whose sum is σ = 171929241627264. Its totient is φ = 157276181257440.
The previous prime is 164521305551333. The next prime is 164521305551347. The reversal of 164521305551341 is 143155503125461.
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 164521305551341 - 23 = 164521305551333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 164521305551291 and 164521305551300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164521305551347) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40702943440 + ... + 40702947481.
It is an arithmetic number, because the mean of its divisors is an integer number (21491155203408).
Almost surely, 2164521305551341 is an apocalyptic number.
It is an amenable number.
164521305551341 is a deficient number, since it is larger than the sum of its proper divisors (7407936075923).
164521305551341 is an equidigital number, since it uses as much as digits as its factorization.
164521305551341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81405891011.
The product of its (nonzero) digits is 1080000, while the sum is 46.
The spelling of 164521305551341 in words is "one hundred sixty-four trillion, five hundred twenty-one billion, three hundred five million, five hundred fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •