Base | Representation |
---|---|
bin | 11001000010101… |
… | …011011010110101 |
3 | 1002021112221111012 |
4 | 121002223122311 |
5 | 1330023220113 |
6 | 105404522005 |
7 | 13261032122 |
oct | 3102533265 |
9 | 1067487435 |
10 | 420132533 |
11 | 1a6176877 |
12 | b8850305 |
13 | 69070142 |
14 | 3db25749 |
15 | 26d3daa8 |
hex | 190ab6b5 |
420132533 has 2 divisors, whose sum is σ = 420132534. Its totient is φ = 420132532.
The previous prime is 420132529. The next prime is 420132563. The reversal of 420132533 is 335231024.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 359557444 + 60575089 = 18962^2 + 7783^2 .
It is a cyclic number.
It is not a de Polignac number, because 420132533 - 22 = 420132529 is a prime.
It is a super-2 number, since 2×4201325332 = 353022690569992178, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 420132499 and 420132508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (420132563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210066266 + 210066267.
It is an arithmetic number, because the mean of its divisors is an integer number (210066267).
Almost surely, 2420132533 is an apocalyptic number.
It is an amenable number.
420132533 is a deficient number, since it is larger than the sum of its proper divisors (1).
420132533 is an equidigital number, since it uses as much as digits as its factorization.
420132533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 420132533 is about 20497.1347509841. The cubic root of 420132533 is about 748.9660020825.
Adding to 420132533 its reverse (335231024), we get a palindrome (755363557).
The spelling of 420132533 in words is "four hundred twenty million, one hundred thirty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •