Base | Representation |
---|---|
bin | 101101011111110101110101… |
… | …111111110000011011111001 |
3 | 222020111101121202022100212222 |
4 | 231133311311333300123321 |
5 | 202211420213004013311 |
6 | 1545324433511013425 |
7 | 60101522523626516 |
oct | 5537656577603371 |
9 | 866441552270788 |
10 | 200100211001081 |
11 | 58838028565706 |
12 | 1a53891796a275 |
13 | 87864a4708021 |
14 | 375ac8aacc30d |
15 | 18200ebaa7adb |
hex | b5fd75ff06f9 |
200100211001081 has 2 divisors, whose sum is σ = 200100211001082. Its totient is φ = 200100211001080.
The previous prime is 200100211000997. The next prime is 200100211001087. The reversal of 200100211001081 is 180100112001002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164339811001081 + 35760400000000 = 12819509^2 + 5980000^2 .
It is a cyclic number.
It is not a de Polignac number, because 200100211001081 - 218 = 200100210738937 is a prime.
It is a super-2 number, since 2×2001002110010812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200100211001087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050105500540 + 100050105500541.
It is an arithmetic number, because the mean of its divisors is an integer number (100050105500541).
Almost surely, 2200100211001081 is an apocalyptic number.
It is an amenable number.
200100211001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100211001081 is an equidigital number, since it uses as much as digits as its factorization.
200100211001081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 200100211001081 its reverse (180100112001002), we get a palindrome (380200323002083).
The spelling of 200100211001081 in words is "two hundred trillion, one hundred billion, two hundred eleven million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •