Base | Representation |
---|---|
bin | 1001001001111101011010… |
… | …10110010101100011110101 |
3 | 2122021201212122210021201122 |
4 | 10210332231112111203311 |
5 | 10114331221011431242 |
6 | 110453055424233325 |
7 | 4145406626406515 |
oct | 444765526254365 |
9 | 78251778707648 |
10 | 20133420030197 |
11 | 6462598803501 |
12 | 2311ba976b845 |
13 | b3075b8a5476 |
14 | 4d8669a29845 |
15 | 24dab30abad2 |
hex | 124fad5958f5 |
20133420030197 has 2 divisors, whose sum is σ = 20133420030198. Its totient is φ = 20133420030196.
The previous prime is 20133420030193. The next prime is 20133420030313. The reversal of 20133420030197 is 79103002433102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16879271016721 + 3254149013476 = 4108439^2 + 1803926^2 .
It is a cyclic number.
It is not a de Polignac number, because 20133420030197 - 22 = 20133420030193 is a prime.
It is a super-2 number, since 2×201334200301972 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20133420030193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066710015098 + 10066710015099.
It is an arithmetic number, because the mean of its divisors is an integer number (10066710015099).
Almost surely, 220133420030197 is an apocalyptic number.
It is an amenable number.
20133420030197 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133420030197 is an equidigital number, since it uses as much as digits as its factorization.
20133420030197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
Adding to 20133420030197 its reverse (79103002433102), we get a palindrome (99236422463299).
The spelling of 20133420030197 in words is "twenty trillion, one hundred thirty-three billion, four hundred twenty million, thirty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •