Base | Representation |
---|---|
bin | 10001010011111… |
… | …01001011110001 |
3 | 101010020202020022 |
4 | 20221331023301 |
5 | 244133404431 |
6 | 22224253225 |
7 | 3412213652 |
oct | 1051751361 |
9 | 333222208 |
10 | 145216241 |
11 | 74a75125 |
12 | 40771215 |
13 | 24115691 |
14 | 15401529 |
15 | cb3707b |
hex | 8a7d2f1 |
145216241 has 2 divisors, whose sum is σ = 145216242. Its totient is φ = 145216240.
The previous prime is 145216177. The next prime is 145216243. The reversal of 145216241 is 142612541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121000000 + 24216241 = 11000^2 + 4921^2 .
It is a cyclic number.
It is not a de Polignac number, because 145216241 - 26 = 145216177 is a prime.
Together with 145216243, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p8190008 and since 145216241 and 8190008 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145216241.
It is not a weakly prime, because it can be changed into another prime (145216243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72608120 + 72608121.
It is an arithmetic number, because the mean of its divisors is an integer number (72608121).
Almost surely, 2145216241 is an apocalyptic number.
It is an amenable number.
145216241 is a deficient number, since it is larger than the sum of its proper divisors (1).
145216241 is an equidigital number, since it uses as much as digits as its factorization.
145216241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1920, while the sum is 26.
The square root of 145216241 is about 12050.5701524866. The cubic root of 145216241 is about 525.6198164056.
Adding to 145216241 its reverse (142612541), we get a palindrome (287828782).
The spelling of 145216241 in words is "one hundred forty-five million, two hundred sixteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •