Base | Representation |
---|---|
bin | 100000100000011… |
… | …011000101110001 |
3 | 1102000012200122201 |
4 | 200200123011301 |
5 | 2104103323411 |
6 | 130041103201 |
7 | 16341400255 |
oct | 4040330561 |
9 | 1360180581 |
10 | 545370481 |
11 | 25a935a07 |
12 | 132787b01 |
13 | 88cac236 |
14 | 52606265 |
15 | 32d2b3c1 |
hex | 2081b171 |
545370481 has 2 divisors, whose sum is σ = 545370482. Its totient is φ = 545370480.
The previous prime is 545370461. The next prime is 545370521. The reversal of 545370481 is 184073545.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 419594256 + 125776225 = 20484^2 + 11215^2 .
It is a cyclic number.
It is not a de Polignac number, because 545370481 - 219 = 544846193 is a prime.
It is a super-2 number, since 2×5453704812 = 594857923092342722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 545370481.
It is not a weakly prime, because it can be changed into another prime (545370401) 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, 272685240 + 272685241.
It is an arithmetic number, because the mean of its divisors is an integer number (272685241).
Almost surely, 2545370481 is an apocalyptic number.
It is an amenable number.
545370481 is a deficient number, since it is larger than the sum of its proper divisors (1).
545370481 is an equidigital number, since it uses as much as digits as its factorization.
545370481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67200, while the sum is 37.
The square root of 545370481 is about 23353.1685430479. The cubic root of 545370481 is about 817.0159639961.
The spelling of 545370481 in words is "five hundred forty-five million, three hundred seventy thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •