Base | Representation |
---|---|
bin | 101101011111110101101001… |
… | …100110110011011010101111 |
3 | 222020111101002021011120121222 |
4 | 231133311221212303122233 |
5 | 202211414301300224403 |
6 | 1545324401123413555 |
7 | 60101514421032443 |
oct | 5537655146633257 |
9 | 866441067146558 |
10 | 200100003133103 |
11 | 58837a31199397 |
12 | 1a53887a2242bb |
13 | 8786470627718 |
14 | 375ac6b25c823 |
15 | 18200d86e7338 |
hex | b5fd699b36af |
200100003133103 has 2 divisors, whose sum is σ = 200100003133104. Its totient is φ = 200100003133102.
The previous prime is 200100003133099. The next prime is 200100003133127. The reversal of 200100003133103 is 301331300001002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200100003133103 - 22 = 200100003133099 is a prime.
It is a super-2 number, since 2×2001000031331032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200100003133403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050001566551 + 100050001566552.
It is an arithmetic number, because the mean of its divisors is an integer number (100050001566552).
Almost surely, 2200100003133103 is an apocalyptic number.
200100003133103 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100003133103 is an equidigital number, since it uses as much as digits as its factorization.
200100003133103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 200100003133103 its reverse (301331300001002), we get a palindrome (501431303134105).
The spelling of 200100003133103 in words is "two hundred trillion, one hundred billion, three million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •