Base | Representation |
---|---|
bin | 10001010010100… |
… | …01011000101001 |
3 | 101002220122010212 |
4 | 20221101120221 |
5 | 244112134331 |
6 | 22220350505 |
7 | 3410535635 |
oct | 1051213051 |
9 | 332818125 |
10 | 145036841 |
11 | 74962364 |
12 | 406a5435 |
13 | 24081b21 |
14 | 15395dc5 |
15 | caedd2b |
hex | 8a51629 |
145036841 has 2 divisors, whose sum is σ = 145036842. Its totient is φ = 145036840.
The previous prime is 145036789. The next prime is 145036847. The reversal of 145036841 is 148630541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137358400 + 7678441 = 11720^2 + 2771^2 .
It is a cyclic number.
It is not a de Polignac number, because 145036841 - 26 = 145036777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145036798 and 145036807.
It is not a weakly prime, because it can be changed into another prime (145036847) 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, 72518420 + 72518421.
It is an arithmetic number, because the mean of its divisors is an integer number (72518421).
Almost surely, 2145036841 is an apocalyptic number.
It is an amenable number.
145036841 is a deficient number, since it is larger than the sum of its proper divisors (1).
145036841 is an equidigital number, since it uses as much as digits as its factorization.
145036841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 145036841 is about 12043.1242208988. The cubic root of 145036841 is about 525.4032771438.
The spelling of 145036841 in words is "one hundred forty-five million, thirty-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •