Base | Representation |
---|---|
bin | 10001010101001… |
… | …00011001010001 |
3 | 101010112220112202 |
4 | 20222210121101 |
5 | 244204024344 |
6 | 22231532545 |
7 | 3413453132 |
oct | 1052443121 |
9 | 333486482 |
10 | 145376849 |
11 | 75074862 |
12 | 4082a155 |
13 | 24170807 |
14 | 15443c89 |
15 | cb6994e |
hex | 8aa4651 |
145376849 has 2 divisors, whose sum is σ = 145376850. Its totient is φ = 145376848.
The previous prime is 145376821. The next prime is 145376867. The reversal of 145376849 is 948673541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145323025 + 53824 = 12055^2 + 232^2 .
It is an emirp because it is prime and its reverse (948673541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145376849 - 224 = 128599633 is a prime.
It is a super-2 number, since 2×1453768492 = 42268856450337602, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (145376879) 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, 72688424 + 72688425.
It is an arithmetic number, because the mean of its divisors is an integer number (72688425).
Almost surely, 2145376849 is an apocalyptic number.
It is an amenable number.
145376849 is a deficient number, since it is larger than the sum of its proper divisors (1).
145376849 is an equidigital number, since it uses as much as digits as its factorization.
145376849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 725760, while the sum is 47.
The square root of 145376849 is about 12057.2322280032. The cubic root of 145376849 is about 525.8135221138.
The spelling of 145376849 in words is "one hundred forty-five million, three hundred seventy-six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •