Base | Representation |
---|---|
bin | 1001001000111111001100… |
… | …00010001110001101000101 |
3 | 2122011112122100101222012122 |
4 | 10210133212002032031011 |
5 | 10113304310344221013 |
6 | 110425452343455325 |
7 | 4143115006145453 |
oct | 444374602161505 |
9 | 78145570358178 |
10 | 20100011320133 |
11 | 644a404425118 |
12 | 2307625157545 |
13 | b2a566257b84 |
14 | 4d6bba9c79d3 |
15 | 24ccaa0a9a08 |
hex | 1247e608e345 |
20100011320133 has 2 divisors, whose sum is σ = 20100011320134. Its totient is φ = 20100011320132.
The previous prime is 20100011320121. The next prime is 20100011320177. The reversal of 20100011320133 is 33102311000102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14621499973249 + 5478511346884 = 3823807^2 + 2340622^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100011320133 - 220 = 20100010271557 is a prime.
It is a super-2 number, since 2×201000113201332 (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 (20100011620133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050005660066 + 10050005660067.
It is an arithmetic number, because the mean of its divisors is an integer number (10050005660067).
Almost surely, 220100011320133 is an apocalyptic number.
It is an amenable number.
20100011320133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100011320133 is an equidigital number, since it uses as much as digits as its factorization.
20100011320133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20100011320133 its reverse (33102311000102), we get a palindrome (53202322320235).
The spelling of 20100011320133 in words is "twenty trillion, one hundred billion, eleven million, three hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •