Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …000111000001001101000 |
3 | 21010020210110002221111100 |
4 | 131100322020320021220 |
5 | 230422032121201300 |
6 | 4135503324001400 |
7 | 265201644545046 |
oct | 35207210701150 |
9 | 7106713087440 |
10 | 2011020100200 |
11 | 705961468211 |
12 | 2858ba690260 |
13 | 11783b6a8917 |
14 | 6d4962b3396 |
15 | 374a06dc700 |
hex | 1d43a238268 |
2011020100200 has 144 divisors (see below), whose sum is σ = 6936207845580. Its totient is φ = 521778170880.
The previous prime is 2011020100189. The next prime is 2011020100261. The reversal of 2011020100200 is 20010201102.
It can be written as a sum of positive squares in 6 ways, for example, as 1152947652516 + 858072447684 = 1073754^2 + 926322^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
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 35 ways as a sum of consecutive naturals, for example, 15031149 + ... + 15164348.
Almost surely, 22011020100200 is an apocalyptic number.
2011020100200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011020100200 is an abundant number, since it is smaller than the sum of its proper divisors (4925187745380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011020100200 is a wasteful number, since it uses less digits than its factorization.
2011020100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30195556 (or 30195544 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2011020100200 its reverse (20010201102), we get a palindrome (2031030301302).
The spelling of 2011020100200 in words is "two trillion, eleven billion, twenty million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.845 sec. • engine limits •