Base | Representation |
---|---|
bin | 1000011110000000101… |
… | …1100110100101000111 |
3 | 111220112210121210020222 |
4 | 2013200023212211013 |
5 | 4340433213340014 |
6 | 150501200014555 |
7 | 13340334410531 |
oct | 2074013464507 |
9 | 456483553228 |
10 | 145495058759 |
11 | 56782193116 |
12 | 2424600145b |
13 | 1094916585b |
14 | 708335a851 |
15 | 3bb836708e |
hex | 21e02e6947 |
145495058759 has 2 divisors, whose sum is σ = 145495058760. Its totient is φ = 145495058758.
The previous prime is 145495058677. The next prime is 145495058771. The reversal of 145495058759 is 957850594541.
It is a strong prime.
It is an emirp because it is prime and its reverse (957850594541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145495058759 - 232 = 141200091463 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145495028759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72747529379 + 72747529380.
It is an arithmetic number, because the mean of its divisors is an integer number (72747529380).
Almost surely, 2145495058759 is an apocalyptic number.
145495058759 is a deficient number, since it is larger than the sum of its proper divisors (1).
145495058759 is an equidigital number, since it uses as much as digits as its factorization.
145495058759 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360000, while the sum is 62.
The spelling of 145495058759 in words is "one hundred forty-five billion, four hundred ninety-five million, fifty-eight thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •