Base | Representation |
---|---|
bin | 10001010110000… |
… | …00101000111001 |
3 | 101010202210020111 |
4 | 20223000220321 |
5 | 244221230122 |
6 | 22234224321 |
7 | 3414444331 |
oct | 1053005071 |
9 | 333683214 |
10 | 145492537 |
11 | 75143773 |
12 | 408850a1 |
13 | 241b1378 |
14 | 154740c1 |
15 | cb8dd77 |
hex | 8ac0a39 |
145492537 has 2 divisors, whose sum is σ = 145492538. Its totient is φ = 145492536.
The previous prime is 145492469. The next prime is 145492553. The reversal of 145492537 is 735294541.
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., 108659776 + 36832761 = 10424^2 + 6069^2 .
It is a cyclic number.
It is not a de Polignac number, because 145492537 - 211 = 145490489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145492537.
It is not a weakly prime, because it can be changed into another prime (145492637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72746268 + 72746269.
It is an arithmetic number, because the mean of its divisors is an integer number (72746269).
Almost surely, 2145492537 is an apocalyptic number.
It is an amenable number.
145492537 is a deficient number, since it is larger than the sum of its proper divisors (1).
145492537 is an equidigital number, since it uses as much as digits as its factorization.
145492537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 151200, while the sum is 40.
The square root of 145492537 is about 12062.0287265451. The cubic root of 145492537 is about 525.9529624407.
The spelling of 145492537 in words is "one hundred forty-five million, four hundred ninety-two thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •