Base | Representation |
---|---|
bin | 111110100110000… |
… | …1100110010100001 |
3 | 12102101011211200221 |
4 | 1331030030302201 |
5 | 13300142200423 |
6 | 544225443041 |
7 | 103022452501 |
oct | 17514146241 |
9 | 5371154627 |
10 | 2100350113 |
11 | 988658144 |
12 | 4a74a0481 |
13 | 2761b1324 |
14 | 15cd3ba01 |
15 | c45d5e5d |
hex | 7d30cca1 |
2100350113 has 2 divisors, whose sum is σ = 2100350114. Its totient is φ = 2100350112.
The previous prime is 2100350081. The next prime is 2100350129. The reversal of 2100350113 is 3110530012.
It is an a-pointer prime, because the next prime (2100350129) can be obtained adding 2100350113 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1791574929 + 308775184 = 42327^2 + 17572^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100350113 - 25 = 2100350081 is a prime.
It is a super-2 number, since 2×21003501132 = 8822941194358225538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2100350183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050175056 + 1050175057.
It is an arithmetic number, because the mean of its divisors is an integer number (1050175057).
Almost surely, 22100350113 is an apocalyptic number.
It is an amenable number.
2100350113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100350113 is an equidigital number, since it uses as much as digits as its factorization.
2100350113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 2100350113 is about 45829.5768363619. The cubic root of 2100350113 is about 1280.6503272890.
Adding to 2100350113 its reverse (3110530012), we get a palindrome (5210880125).
The spelling of 2100350113 in words is "two billion, one hundred million, three hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •