Base | Representation |
---|---|
bin | 1000011100001110010… |
… | …0110111010110001011 |
3 | 111212022100120110220201 |
4 | 2013003210313112023 |
5 | 4333442334014041 |
6 | 150341413433031 |
7 | 13322416236613 |
oct | 2070344672613 |
9 | 455270513821 |
10 | 145015141771 |
11 | 565562a3405 |
12 | 2413133b777 |
13 | 108a08c28c6 |
14 | 7039711a43 |
15 | 3b8b169631 |
hex | 21c393758b |
145015141771 has 2 divisors, whose sum is σ = 145015141772. Its totient is φ = 145015141770.
The previous prime is 145015141723. The next prime is 145015141847. The reversal of 145015141771 is 177141510541.
145015141771 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145015141771 - 215 = 145015109003 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145015141771.
It is not a weakly prime, because it can be changed into another prime (145015141171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72507570885 + 72507570886.
It is an arithmetic number, because the mean of its divisors is an integer number (72507570886).
Almost surely, 2145015141771 is an apocalyptic number.
145015141771 is a deficient number, since it is larger than the sum of its proper divisors (1).
145015141771 is an equidigital number, since it uses as much as digits as its factorization.
145015141771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19600, while the sum is 37.
The spelling of 145015141771 in words is "one hundred forty-five billion, fifteen million, one hundred forty-one thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •