Base | Representation |
---|---|
bin | 11101010000001001010… |
… | …100101001011100010100 |
3 | 21010011200101000112022101 |
4 | 131100021110221130110 |
5 | 230413342440231400 |
6 | 4135250150011444 |
7 | 265142441304352 |
oct | 35201124513424 |
9 | 7104611015271 |
10 | 2010201102100 |
11 | 705581130884 |
12 | 285710346b84 |
13 | 11773ab03669 |
14 | 6d4196007d2 |
15 | 3745386156a |
hex | 1d409529714 |
2010201102100 has 36 divisors (see below), whose sum is σ = 4384974843648. Its totient is φ = 799870588000.
The previous prime is 2010201102073. The next prime is 2010201102131. The reversal of 2010201102100 is 12011020102.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 11 ways as a sum of consecutive naturals, for example, 52603966 + ... + 52642165.
It is an arithmetic number, because the mean of its divisors is an integer number (121804856768).
Almost surely, 22010201102100 is an apocalyptic number.
2010201102100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010201102100 is an abundant number, since it is smaller than the sum of its proper divisors (2374773741548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010201102100 is a wasteful number, since it uses less digits than its factorization.
2010201102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105246336 (or 105246329 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2010201102100 its reverse (12011020102), we get a palindrome (2022212122202).
The spelling of 2010201102100 in words is "two trillion, ten billion, two hundred one million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •