Base | Representation |
---|---|
bin | 101111110010111110010110… |
… | …000000100100100001000111 |
3 | 1000120021222121001211022101212 |
4 | 233302332112000210201013 |
5 | 210023044313340200403 |
6 | 2023025351403442035 |
7 | 62164152022505345 |
oct | 5762762600444107 |
9 | 1016258531738355 |
10 | 210211101100103 |
11 | 60a86033419364 |
12 | 1b6b03a052631b |
13 | 903aa8b59b34c |
14 | 39ca3b3300995 |
15 | 1948116d164d8 |
hex | bf2f96024847 |
210211101100103 has 2 divisors, whose sum is σ = 210211101100104. Its totient is φ = 210211101100102.
The previous prime is 210211101100093. The next prime is 210211101100109. The reversal of 210211101100103 is 301001101112012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210211101100103 - 24 = 210211101100087 is a prime.
It is a super-2 number, since 2×2102111011001032 (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 (210211101100109) 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 as a sum of consecutive naturals, namely, 105105550550051 + 105105550550052.
It is an arithmetic number, because the mean of its divisors is an integer number (105105550550052).
Almost surely, 2210211101100103 is an apocalyptic number.
210211101100103 is a deficient number, since it is larger than the sum of its proper divisors (1).
210211101100103 is an equidigital number, since it uses as much as digits as its factorization.
210211101100103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 210211101100103 its reverse (301001101112012), we get a palindrome (511212202212115).
The spelling of 210211101100103 in words is "two hundred ten trillion, two hundred eleven billion, one hundred one million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •