Base | Representation |
---|---|
bin | 101101011110011010011110… |
… | …001100101001001001110001 |
3 | 222020011000101022110002110122 |
4 | 231132122132030221021301 |
5 | 202203313300403014303 |
6 | 1545211410305540025 |
7 | 60061450341352304 |
oct | 5536323614511161 |
9 | 866130338402418 |
10 | 200002101219953 |
11 | 587aa462104a6a |
12 | 1a5218b7044615 |
13 | 877a16a6b60b6 |
14 | 3756220b0ab3b |
15 | 181c7a8797e38 |
hex | b5e69e329271 |
200002101219953 has 2 divisors, whose sum is σ = 200002101219954. Its totient is φ = 200002101219952.
The previous prime is 200002101219941. The next prime is 200002101220049. The reversal of 200002101219953 is 359912101200002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143621720755984 + 56380380463969 = 11984228^2 + 7508687^2 .
It is a cyclic number.
It is not a de Polignac number, because 200002101219953 - 24 = 200002101219937 is a prime.
It is a super-3 number, since 3×2000021012199533 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (200002101219353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100001050609976 + 100001050609977.
It is an arithmetic number, because the mean of its divisors is an integer number (100001050609977).
Almost surely, 2200002101219953 is an apocalyptic number.
It is an amenable number.
200002101219953 is a deficient number, since it is larger than the sum of its proper divisors (1).
200002101219953 is an equidigital number, since it uses as much as digits as its factorization.
200002101219953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 35.
Adding to 200002101219953 its reverse (359912101200002), we get a palindrome (559914202419955).
The spelling of 200002101219953 in words is "two hundred trillion, two billion, one hundred one million, two hundred nineteen thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •