Base | Representation |
---|---|
bin | 10001011001110… |
… | …11011111000111 |
3 | 101011201100110212 |
4 | 20230323133013 |
5 | 244333330334 |
6 | 22253110035 |
7 | 3421641332 |
oct | 1054733707 |
9 | 334640425 |
10 | 145995719 |
11 | 75457821 |
12 | 40a8831b |
13 | 243293cc |
14 | 15565619 |
15 | cc3cece |
hex | 8b3b7c7 |
145995719 has 2 divisors, whose sum is σ = 145995720. Its totient is φ = 145995718.
The previous prime is 145995691. The next prime is 145995749. The reversal of 145995719 is 917599541.
It is a weak prime.
It is an emirp because it is prime and its reverse (917599541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145995719 - 28 = 145995463 is a prime.
It is a super-2 number, since 2×1459957192 = 42629499932653922, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145995749) 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, 72997859 + 72997860.
It is an arithmetic number, because the mean of its divisors is an integer number (72997860).
Almost surely, 2145995719 is an apocalyptic number.
145995719 is a deficient number, since it is larger than the sum of its proper divisors (1).
145995719 is an equidigital number, since it uses as much as digits as its factorization.
145995719 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 510300, while the sum is 50.
The square root of 145995719 is about 12082.8688232555. The cubic root of 145995719 is about 526.5585961472.
The spelling of 145995719 in words is "one hundred forty-five million, nine hundred ninety-five thousand, seven hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •