Base | Representation |
---|---|
bin | 101101100001010010111001… |
… | …001010000000100111110111 |
3 | 222020211221111201111111110112 |
4 | 231201102321022000213313 |
5 | 202220034322213310403 |
6 | 1545442355534413235 |
7 | 60111660440324225 |
oct | 5541227112004767 |
9 | 866757451444415 |
10 | 200200122010103 |
11 | 58876438739546 |
12 | 1a55415b96121b |
13 | 8792a37959b87 |
14 | 3761a47dc5b15 |
15 | 18229e80b49d8 |
hex | b614b92809f7 |
200200122010103 has 16 divisors (see below), whose sum is σ = 208545800117760. Its totient is φ = 191952837669600.
The previous prime is 200200122010069. The next prime is 200200122010123. The reversal of 200200122010103 is 301010221002002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 200200122010103 - 26 = 200200122010039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200200122010123) 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 in 15 ways as a sum of consecutive naturals, for example, 15054413 + ... + 25040678.
It is an arithmetic number, because the mean of its divisors is an integer number (13034112507360).
Almost surely, 2200200122010103 is an apocalyptic number.
200200122010103 is a deficient number, since it is larger than the sum of its proper divisors (8345678107657).
200200122010103 is a wasteful number, since it uses less digits than its factorization.
200200122010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40096318.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 200200122010103 its reverse (301010221002002), we get a palindrome (501210343012105).
The spelling of 200200122010103 in words is "two hundred trillion, two hundred billion, one hundred twenty-two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •