Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …00111101111101110101 |
3 | 10112121200200010122022211 |
4 | 32203200210331331311 |
5 | 112341402222400203 |
6 | 2043252521253421 |
7 | 132155615265445 |
oct | 16434044757565 |
9 | 3477620118284 |
10 | 1000200200053 |
11 | 356200a3518a |
12 | 141a19034271 |
13 | 7341a8c2c02 |
14 | 365a4c7c125 |
15 | 1b03e10ec6d |
hex | e8e093df75 |
1000200200053 has 2 divisors, whose sum is σ = 1000200200054. Its totient is φ = 1000200200052.
The previous prime is 1000200199997. The next prime is 1000200200057. The reversal of 1000200200053 is 3500020020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 992858794929 + 7341405124 = 996423^2 + 85682^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000200200053 is a prime.
It is a super-2 number, since 2×10002002000532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000200200057) 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, 500100100026 + 500100100027.
It is an arithmetic number, because the mean of its divisors is an integer number (500100100027).
Almost surely, 21000200200053 is an apocalyptic number.
It is an amenable number.
1000200200053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000200200053 is an equidigital number, since it uses as much as digits as its factorization.
1000200200053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 13.
Adding to 1000200200053 its reverse (3500020020001), we get a palindrome (4500220220054).
The spelling of 1000200200053 in words is "one trillion, two hundred million, two hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •