Base | Representation |
---|---|
bin | 10001010110011… |
… | …01100000010001 |
3 | 101010212110112012 |
4 | 20223031200101 |
5 | 244224421413 |
6 | 22235312305 |
7 | 3415054061 |
oct | 1053154021 |
9 | 333773465 |
10 | 145545233 |
11 | 7517a319 |
12 | 408ab695 |
13 | 241cc352 |
14 | 154893a1 |
15 | cb9e7a8 |
hex | 8acd811 |
145545233 has 2 divisors, whose sum is σ = 145545234. Its totient is φ = 145545232.
The previous prime is 145545209. The next prime is 145545241. The reversal of 145545233 is 332545541.
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., 143448529 + 2096704 = 11977^2 + 1448^2 .
It is an emirp because it is prime and its reverse (332545541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 145545233 - 28 = 145544977 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 145545233.
It is not a weakly prime, because it can be changed into another prime (145545133) 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, 72772616 + 72772617.
It is an arithmetic number, because the mean of its divisors is an integer number (72772617).
Almost surely, 2145545233 is an apocalyptic number.
It is an amenable number.
145545233 is a deficient number, since it is larger than the sum of its proper divisors (1).
145545233 is an equidigital number, since it uses as much as digits as its factorization.
145545233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36000, while the sum is 32.
The square root of 145545233 is about 12064.2129042885. The cubic root of 145545233 is about 526.0164531471.
The spelling of 145545233 in words is "one hundred forty-five million, five hundred forty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •