Base | Representation |
---|---|
bin | 100101011001000100001001… |
… | …011001011001111011111001 |
3 | 210120021021121102201001122021 |
4 | 211121010021121121323321 |
5 | 133023322412033420241 |
6 | 1341431205531554441 |
7 | 46432063165040023 |
oct | 4531041131317371 |
9 | 716237542631567 |
10 | 164450160451321 |
11 | 48442a15405798 |
12 | 1653b661bbba21 |
13 | 709b7781b8c04 |
14 | 2c876047c7013 |
15 | 1402ad57120d1 |
hex | 959109659ef9 |
164450160451321 has 2 divisors, whose sum is σ = 164450160451322. Its totient is φ = 164450160451320.
The previous prime is 164450160451303. The next prime is 164450160451331. The reversal of 164450160451321 is 123154061054461.
164450160451321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 155566249664400 + 8883910786921 = 12472620^2 + 2980589^2 .
It is a cyclic number.
It is not a de Polignac number, because 164450160451321 - 217 = 164450160320249 is a prime.
It is not a weakly prime, because it can be changed into another prime (164450160451301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82225080225660 + 82225080225661.
It is an arithmetic number, because the mean of its divisors is an integer number (82225080225661).
Almost surely, 2164450160451321 is an apocalyptic number.
It is an amenable number.
164450160451321 is a deficient number, since it is larger than the sum of its proper divisors (1).
164450160451321 is an equidigital number, since it uses as much as digits as its factorization.
164450160451321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 164450160451321 in words is "one hundred sixty-four trillion, four hundred fifty billion, one hundred sixty million, four hundred fifty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •