Base | Representation |
---|---|
bin | 1000011100100010110… |
… | …0110110011011110111 |
3 | 111212112100100200121122 |
4 | 2013020230312123313 |
5 | 4334131341340041 |
6 | 150354124334155 |
7 | 13324512115661 |
oct | 2071054663367 |
9 | 455470320548 |
10 | 145101121271 |
11 | 5659a889047 |
12 | 241560a435b |
13 | 108b5667852 |
14 | 7046cd3531 |
15 | 3b9399ec4b |
hex | 21c8b366f7 |
145101121271 has 2 divisors, whose sum is σ = 145101121272. Its totient is φ = 145101121270.
The previous prime is 145101121219. The next prime is 145101121279. The reversal of 145101121271 is 172121101541.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145101121271 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145101121271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145101121279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72550560635 + 72550560636.
It is an arithmetic number, because the mean of its divisors is an integer number (72550560636).
Almost surely, 2145101121271 is an apocalyptic number.
145101121271 is a deficient number, since it is larger than the sum of its proper divisors (1).
145101121271 is an equidigital number, since it uses as much as digits as its factorization.
145101121271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 26.
The spelling of 145101121271 in words is "one hundred forty-five billion, one hundred one million, one hundred twenty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •