Base | Representation |
---|---|
bin | 101101011111110110110010… |
… | …010000011100110011110111 |
3 | 222020111111020012200221112120 |
4 | 231133312302100130303313 |
5 | 202211424300313310403 |
6 | 1545325122104251023 |
7 | 60101556551231631 |
oct | 5537666220346367 |
9 | 866444205627476 |
10 | 200101222010103 |
11 | 588384a7218757 |
12 | 1a538b5a470a73 |
13 | 8786605ccb10b |
14 | 375ad450a3a51 |
15 | 182015a710e53 |
hex | b5fdb241ccf7 |
200101222010103 has 4 divisors (see below), whose sum is σ = 266801629346808. Its totient is φ = 133400814673400.
The previous prime is 200101222010083. The next prime is 200101222010219. The reversal of 200101222010103 is 301010222101002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200101222010103 - 28 = 200101222009847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200101222010303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33350203668348 + ... + 33350203668353.
It is an arithmetic number, because the mean of its divisors is an integer number (66700407336702).
Almost surely, 2200101222010103 is an apocalyptic number.
200101222010103 is a deficient number, since it is larger than the sum of its proper divisors (66700407336705).
200101222010103 is an equidigital number, since it uses as much as digits as its factorization.
200101222010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66700407336704.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 200101222010103 its reverse (301010222101002), we get a palindrome (501111444111105).
The spelling of 200101222010103 in words is "two hundred trillion, one hundred one billion, two hundred twenty-two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •