Base | Representation |
---|---|
bin | 11110101111011101011… |
… | …000001101000011100000 |
3 | 21110221211202110020212021 |
4 | 132233131120031003200 |
5 | 234102442010131000 |
6 | 4254253333111224 |
7 | 305424533443213 |
oct | 36573530150340 |
9 | 7427752406767 |
10 | 2112543052000 |
11 | 744a1952a567 |
12 | 2a1512488514 |
13 | 12429a885474 |
14 | 743676cd77a |
15 | 39e434a711a |
hex | 1ebdd60d0e0 |
2112543052000 has 96 divisors (see below), whose sum is σ = 5202565490304. Its totient is φ = 843055936000.
The previous prime is 2112543051959. The next prime is 2112543052033. The reversal of 2112543052000 is 2503452112.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1111314 + ... + 2336686.
It is an arithmetic number, because the mean of its divisors is an integer number (54193390524).
Almost surely, 22112543052000 is an apocalyptic number.
2112543052000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112543052000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2601282745152).
2112543052000 is an abundant number, since it is smaller than the sum of its proper divisors (3090022438304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112543052000 is a wasteful number, since it uses less digits than its factorization.
2112543052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1225829 (or 1225811 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The spelling of 2112543052000 in words is "two trillion, one hundred twelve billion, five hundred forty-three million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •