Base | Representation |
---|---|
bin | 1010110111000… |
… | …1010110001001 |
3 | 10011201100000101 |
4 | 2231301112021 |
5 | 43130144113 |
6 | 4304205401 |
7 | 1062123451 |
oct | 255612611 |
9 | 104640011 |
10 | 45553033 |
11 | 23793739 |
12 | 13309861 |
13 | 958c276 |
14 | 609ad61 |
15 | 3eec2dd |
hex | 2b71589 |
45553033 has 2 divisors, whose sum is σ = 45553034. Its totient is φ = 45553032.
The previous prime is 45553021. The next prime is 45553049. The reversal of 45553033 is 33035554.
45553033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39337984 + 6215049 = 6272^2 + 2493^2 .
It is a cyclic number.
It is not a de Polignac number, because 45553033 - 213 = 45544841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45552992 and 45553010.
It is not a weakly prime, because it can be changed into another prime (45553073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22776516 + 22776517.
It is an arithmetic number, because the mean of its divisors is an integer number (22776517).
Almost surely, 245553033 is an apocalyptic number.
It is an amenable number.
45553033 is a deficient number, since it is larger than the sum of its proper divisors (1).
45553033 is an equidigital number, since it uses as much as digits as its factorization.
45553033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 28.
The square root of 45553033 is about 6749.2987043100. The cubic root of 45553033 is about 357.1404976530.
Adding to 45553033 its reverse (33035554), we get a palindrome (78588587).
The spelling of 45553033 in words is "forty-five million, five hundred fifty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •