Base | Representation |
---|---|
bin | 11001000011100111111011… |
… | …111001100111110110000111 |
3 | 112110012000222120010012211111 |
4 | 121003213323321213312013 |
5 | 103421010003214200403 |
6 | 1030213135101345451 |
7 | 32132462511345643 |
oct | 3103477371476607 |
9 | 473160876105744 |
10 | 110200202100103 |
11 | 32127709199175 |
12 | 10439654868287 |
13 | 4964ab043179b |
14 | 1d2da0abcdc23 |
15 | cb18607a856d |
hex | 6439fbe67d87 |
110200202100103 has 2 divisors, whose sum is σ = 110200202100104. Its totient is φ = 110200202100102.
The previous prime is 110200202100097. The next prime is 110200202100167. The reversal of 110200202100103 is 301001202002011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110200202100103 - 25 = 110200202100071 is a prime.
It is a super-2 number, since 2×1102002021001032 (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 (110200202100173) 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 as a sum of consecutive naturals, namely, 55100101050051 + 55100101050052.
It is an arithmetic number, because the mean of its divisors is an integer number (55100101050052).
Almost surely, 2110200202100103 is an apocalyptic number.
110200202100103 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200202100103 is an equidigital number, since it uses as much as digits as its factorization.
110200202100103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110200202100103 its reverse (301001202002011), we get a palindrome (411201404102114).
The spelling of 110200202100103 in words is "one hundred ten trillion, two hundred billion, two hundred two million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •