Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …10011111100111100100101 |
3 | 2121212220010121012101111221 |
4 | 10203111011103330330211 |
5 | 10111001432342044213 |
6 | 110325021415500341 |
7 | 4134253253231623 |
oct | 443250523747445 |
9 | 77786117171457 |
10 | 20020005424933 |
11 | 6419489161978 |
12 | 22b40173876b1 |
13 | b22b55b3a997 |
14 | 4d2d8b156513 |
15 | 24ab7632438d |
hex | 1235454fcf25 |
20020005424933 has 2 divisors, whose sum is σ = 20020005424934. Its totient is φ = 20020005424932.
The previous prime is 20020005424921. The next prime is 20020005424949. The reversal of 20020005424933 is 33942450002002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15740080260129 + 4279925164804 = 3967377^2 + 2068798^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020005424933 - 25 = 20020005424901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20420005424933) 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, 10010002712466 + 10010002712467.
It is an arithmetic number, because the mean of its divisors is an integer number (10010002712467).
Almost surely, 220020005424933 is an apocalyptic number.
It is an amenable number.
20020005424933 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020005424933 is an equidigital number, since it uses as much as digits as its factorization.
20020005424933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 20020005424933 its reverse (33942450002002), we get a palindrome (53962455426935).
The spelling of 20020005424933 in words is "twenty trillion, twenty billion, five million, four hundred twenty-four thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •