Base | Representation |
---|---|
bin | 11101010000111001101… |
… | …011010010001010000000 |
3 | 21010020202220111210210102 |
4 | 131100321223102022000 |
5 | 230422023124424100 |
6 | 4135502445421532 |
7 | 265201521604415 |
oct | 35207153221200 |
9 | 7106686453712 |
10 | 2011012342400 |
11 | 705958049706 |
12 | 2858b7b6a8a8 |
13 | 117839bc07c9 |
14 | 6d49525410c |
15 | 3749eba8cd5 |
hex | 1d439ad2280 |
2011012342400 has 96 divisors (see below), whose sum is σ = 4996546076700. Its totient is φ = 799754977280.
The previous prime is 2011012342357. The next prime is 2011012342487. The reversal of 2011012342400 is 42432101102.
It can be written as a sum of positive squares in 6 ways, for example, as 1446554641984 + 564457700416 = 1202728^2 + 751304^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 1262705 + ... + 2369904.
Almost surely, 22011012342400 is an apocalyptic number.
2011012342400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011012342400 is an abundant number, since it is smaller than the sum of its proper divisors (2985533734300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011012342400 is a wasteful number, since it uses less digits than its factorization.
2011012342400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3632806 (or 3632789 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 2011012342400 its reverse (42432101102), we get a palindrome (2053444443502).
The spelling of 2011012342400 in words is "two trillion, eleven billion, twelve million, three hundred forty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •