Base | Representation |
---|---|
bin | 1000011100110001110… |
… | …1111111110001011101 |
3 | 111212200202022100020002 |
4 | 2013030131333301131 |
5 | 4334244032224341 |
6 | 150404303304045 |
7 | 13326210333062 |
oct | 2071435776135 |
9 | 455622270202 |
10 | 145164336221 |
11 | 56622535403 |
12 | 241732ab025 |
13 | 108c579bc48 |
14 | 705146ac69 |
15 | 3b992da29b |
hex | 21cc77fc5d |
145164336221 has 2 divisors, whose sum is σ = 145164336222. Its totient is φ = 145164336220.
The previous prime is 145164336203. The next prime is 145164336241. The reversal of 145164336221 is 122633461541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128962864996 + 16201471225 = 359114^2 + 127285^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145164336221 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145164336241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72582168110 + 72582168111.
It is an arithmetic number, because the mean of its divisors is an integer number (72582168111).
Almost surely, 2145164336221 is an apocalyptic number.
It is an amenable number.
145164336221 is a deficient number, since it is larger than the sum of its proper divisors (1).
145164336221 is an equidigital number, since it uses as much as digits as its factorization.
145164336221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 38.
Adding to 145164336221 its reverse (122633461541), we get a palindrome (267797797762).
The spelling of 145164336221 in words is "one hundred forty-five billion, one hundred sixty-four million, three hundred thirty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •