Base | Representation |
---|---|
bin | 11101010010011100000… |
… | …101011000001110111000 |
3 | 21010102000222011200201110 |
4 | 131102130011120032320 |
5 | 230433413304201300 |
6 | 4140334344320320 |
7 | 265260450130266 |
oct | 35223405301670 |
9 | 7112028150643 |
10 | 2012663350200 |
11 | 706624a9a268 |
12 | 286098a730a0 |
13 | 117a40c755b9 |
14 | 6d5b0625436 |
15 | 37549ad1550 |
hex | 1d49c1583b8 |
2012663350200 has 96 divisors (see below), whose sum is σ = 6440522780160. Its totient is φ = 519396988800.
The previous prime is 2012663350177. The next prime is 2012663350219. The reversal of 2012663350200 is 20533662102.
It is a super-2 number, since 2×20126633502002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 54085254 + ... + 54122453.
It is an arithmetic number, because the mean of its divisors is an integer number (67088778960).
Almost surely, 22012663350200 is an apocalyptic number.
2012663350200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012663350200 is an abundant number, since it is smaller than the sum of its proper divisors (4427859429960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012663350200 is a wasteful number, since it uses less digits than its factorization.
2012663350200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108207757 (or 108207748 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
The spelling of 2012663350200 in words is "two trillion, twelve billion, six hundred sixty-three million, three hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •