Base | Representation |
---|---|
bin | 10100110111111111… |
… | …111101100011000101 |
3 | 2010212002112222112212 |
4 | 110313333331203011 |
5 | 331401033204113 |
6 | 14144053153205 |
7 | 1422306556511 |
oct | 246777754305 |
9 | 63762488485 |
10 | 22414350533 |
11 | 9562353343 |
12 | 441662b805 |
13 | 2162949413 |
14 | 1128bdd141 |
15 | 8b2bc90a8 |
hex | 537ffd8c5 |
22414350533 has 2 divisors, whose sum is σ = 22414350534. Its totient is φ = 22414350532.
The previous prime is 22414350463. The next prime is 22414350547. The reversal of 22414350533 is 33505341422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22370287489 + 44063044 = 149567^2 + 6638^2 .
It is a cyclic number.
It is not a de Polignac number, because 22414350533 - 210 = 22414349509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22414350533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22414352533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11207175266 + 11207175267.
It is an arithmetic number, because the mean of its divisors is an integer number (11207175267).
Almost surely, 222414350533 is an apocalyptic number.
It is an amenable number.
22414350533 is a deficient number, since it is larger than the sum of its proper divisors (1).
22414350533 is an equidigital number, since it uses as much as digits as its factorization.
22414350533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 22414350533 its reverse (33505341422), we get a palindrome (55919691955).
The spelling of 22414350533 in words is "twenty-two billion, four hundred fourteen million, three hundred fifty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •