Base | Representation |
---|---|
bin | 101010000110101110… |
… | …111011000101010101 |
3 | 11022200202211002020122 |
4 | 222012232323011111 |
5 | 1220042242324113 |
6 | 32434053441325 |
7 | 3160230453404 |
oct | 520656730525 |
9 | 138622732218 |
10 | 45210120533 |
11 | 1819aa30786 |
12 | 8918940245 |
13 | 43565ccb16 |
14 | 228c52763b |
15 | 12990e6408 |
hex | a86bbb155 |
45210120533 has 2 divisors, whose sum is σ = 45210120534. Its totient is φ = 45210120532.
The previous prime is 45210120491. The next prime is 45210120539. The reversal of 45210120533 is 33502101254.
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., 29834616529 + 15375504004 = 172727^2 + 123998^2 .
It is a cyclic number.
It is not a de Polignac number, because 45210120533 - 26 = 45210120469 is a prime.
It is a super-3 number, since 3×452101205333 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45210120539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22605060266 + 22605060267.
It is an arithmetic number, because the mean of its divisors is an integer number (22605060267).
Almost surely, 245210120533 is an apocalyptic number.
It is an amenable number.
45210120533 is a deficient number, since it is larger than the sum of its proper divisors (1).
45210120533 is an equidigital number, since it uses as much as digits as its factorization.
45210120533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 45210120533 its reverse (33502101254), we get a palindrome (78712221787).
The spelling of 45210120533 in words is "forty-five billion, two hundred ten million, one hundred twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •