Base | Representation |
---|---|
bin | 100000001010100001111… |
… | …111101100101101000100 |
3 | 21211022020202202201210120 |
4 | 200022201333230231010 |
5 | 242203224220120400 |
6 | 4411225000421540 |
7 | 315456030451140 |
oct | 40124177545504 |
9 | 7738222681716 |
10 | 2210331020100 |
11 | 78243a268325 |
12 | 2b84634778b0 |
13 | 13058300cb98 |
14 | 78da2a60220 |
15 | 3c7683e9ca0 |
hex | 202a1fecb44 |
2210331020100 has 144 divisors (see below), whose sum is σ = 7626603199488. Its totient is φ = 483252485760.
The previous prime is 2210331020069. The next prime is 2210331020113. The reversal of 2210331020100 is 10201330122.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2210331020100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22832974 + ... + 22929573.
Almost surely, 22210331020100 is an apocalyptic number.
2210331020100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2210331020100 is an abundant number, since it is smaller than the sum of its proper divisors (5416272179388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210331020100 is a wasteful number, since it uses less digits than its factorization.
2210331020100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45762594 (or 45762587 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2210331020100 its reverse (10201330122), we get a palindrome (2220532350222).
The spelling of 2210331020100 in words is "two trillion, two hundred ten billion, three hundred thirty-one million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •