Base | Representation |
---|---|
bin | 111110100110000… |
… | …1101110001100110 |
3 | 12102101012001020110 |
4 | 1331030031301212 |
5 | 13300142313100 |
6 | 544225513450 |
7 | 103022500326 |
oct | 17514156146 |
9 | 5371161213 |
10 | 2100354150 |
11 | 988660184 |
12 | 4a74a2886 |
13 | 2761b310b |
14 | 15cd3d286 |
15 | c45d7250 |
hex | 7d30dc66 |
2100354150 has 48 divisors (see below), whose sum is σ = 5335939728. Its totient is φ = 546432000.
The previous prime is 2100354149. The next prime is 2100354161. The reversal of 2100354150 is 514530012.
It is a super-2 number, since 2×21003541502 = 8822975110844445000, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 164611 + ... + 176910.
It is an arithmetic number, because the mean of its divisors is an integer number (111165411).
Almost surely, 22100354150 is an apocalyptic number.
2100354150 is an abundant number, since it is smaller than the sum of its proper divisors (3235585578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100354150 is a wasteful number, since it uses less digits than its factorization.
2100354150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341577 (or 341572 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 2100354150 is about 45829.6208799506. The cubic root of 2100354150 is about 1280.6511477842.
Adding to 2100354150 its reverse (514530012), we get a palindrome (2614884162).
It can be divided in two parts, 210035 and 4150, that added together give a triangular number (214185 = T654).
The spelling of 2100354150 in words is "two billion, one hundred million, three hundred fifty-four thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •