Base | Representation |
---|---|
bin | 1001001001111101011011… |
… | …11101111111010010001001 |
3 | 2122021201220101100101022201 |
4 | 10210332231331333102021 |
5 | 10114331231142042323 |
6 | 110453100435120201 |
7 | 4145410113641314 |
oct | 444765575772211 |
9 | 78251811311281 |
10 | 20133430424713 |
11 | 64625a3663011 |
12 | 2311bb1143061 |
13 | b30760aa4778 |
14 | 4d866b17397b |
15 | 24dab3e618ad |
hex | 124fadf7f489 |
20133430424713 has 2 divisors, whose sum is σ = 20133430424714. Its totient is φ = 20133430424712.
The previous prime is 20133430424677. The next prime is 20133430424771. The reversal of 20133430424713 is 31742403433102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19326688741369 + 806741683344 = 4396213^2 + 898188^2 .
It is a cyclic number.
It is not a de Polignac number, because 20133430424713 - 213 = 20133430416521 is a prime.
It is a super-2 number, since 2×201334304247132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20133430454713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066715212356 + 10066715212357.
It is an arithmetic number, because the mean of its divisors is an integer number (10066715212357).
Almost surely, 220133430424713 is an apocalyptic number.
It is an amenable number.
20133430424713 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133430424713 is an equidigital number, since it uses as much as digits as its factorization.
20133430424713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 37.
Adding to 20133430424713 its reverse (31742403433102), we get a palindrome (51875833857815).
The spelling of 20133430424713 in words is "twenty trillion, one hundred thirty-three billion, four hundred thirty million, four hundred twenty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •