Base | Representation |
---|---|
bin | 111110100110000… |
… | …0001010100001001 |
3 | 12102101002110020012 |
4 | 1331030001110021 |
5 | 13300134144423 |
6 | 544224441305 |
7 | 103022165456 |
oct | 17514012411 |
9 | 5371073205 |
10 | 2100303113 |
11 | 9886258a7 |
12 | 4a7479235 |
13 | 276195b0c |
14 | 15cd2882d |
15 | c45c7078 |
hex | 7d301509 |
2100303113 has 8 divisors (see below), whose sum is σ = 2167915200. Its totient is φ = 2033262000.
The previous prime is 2100303109. The next prime is 2100303143. The reversal of 2100303113 is 3113030012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2100303113 - 22 = 2100303109 is a prime.
It is a super-2 number, since 2×21003031132 = 8822546332954981538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2100303143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135263 + ... + 149988.
It is an arithmetic number, because the mean of its divisors is an integer number (270989400).
Almost surely, 22100303113 is an apocalyptic number.
It is an amenable number.
2100303113 is a deficient number, since it is larger than the sum of its proper divisors (67612087).
2100303113 is a wasteful number, since it uses less digits than its factorization.
2100303113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285487.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 2100303113 is about 45829.0640641940. The cubic root of 2100303113 is about 1280.6407747523.
Adding to 2100303113 its reverse (3113030012), we get a palindrome (5213333125).
The spelling of 2100303113 in words is "two billion, one hundred million, three hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •