Base | Representation |
---|---|
bin | 10001010111110… |
… | …00000101011001 |
3 | 101011012022202202 |
4 | 20223320011121 |
5 | 244301012031 |
6 | 22243135545 |
7 | 3416411414 |
oct | 1053700531 |
9 | 334168682 |
10 | 145719641 |
11 | 75289361 |
12 | 409745b5 |
13 | 24260852 |
14 | 154d2b7b |
15 | cbd62cb |
hex | 8af8159 |
145719641 has 2 divisors, whose sum is σ = 145719642. Its totient is φ = 145719640.
The previous prime is 145719589. The next prime is 145719643. The reversal of 145719641 is 146917541.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84254041 + 61465600 = 9179^2 + 7840^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145719641 is a prime.
It is a Sophie Germain prime.
Together with 145719643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145719595 and 145719604.
It is not a weakly prime, because it can be changed into another prime (145719643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72859820 + 72859821.
It is an arithmetic number, because the mean of its divisors is an integer number (72859821).
Almost surely, 2145719641 is an apocalyptic number.
It is an amenable number.
145719641 is a deficient number, since it is larger than the sum of its proper divisors (1).
145719641 is an equidigital number, since it uses as much as digits as its factorization.
145719641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30240, while the sum is 38.
The square root of 145719641 is about 12071.4390608577. The cubic root of 145719641 is about 526.2264791650.
The spelling of 145719641 in words is "one hundred forty-five million, seven hundred nineteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •