Base | Representation |
---|---|
bin | 100000000001011001010… |
… | …001000110111010000000 |
3 | 21210100221002022122002111 |
4 | 200001121101012322000 |
5 | 242023131323200022 |
6 | 4402523320025104 |
7 | 314660650065316 |
oct | 40013121067200 |
9 | 7710832278074 |
10 | 2200520912512 |
11 | 77926576229a |
12 | 2b6586002194 |
13 | 12c67b77b1b0 |
14 | 78711c0c0b6 |
15 | 3c39204b477 |
hex | 20059446e80 |
2200520912512 has 128 divisors (see below), whose sum is σ = 4895754514560. Its totient is φ = 978578952192.
The previous prime is 2200520912461. The next prime is 2200520912531. The reversal of 2200520912512 is 2152190250022.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6168003 + ... + 6515005.
It is an arithmetic number, because the mean of its divisors is an integer number (38248082145).
Almost surely, 22200520912512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2200520912512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2447877257280).
2200520912512 is an abundant number, since it is smaller than the sum of its proper divisors (2695233602048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200520912512 is a wasteful number, since it uses less digits than its factorization.
2200520912512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347170 (or 347158 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
The spelling of 2200520912512 in words is "two trillion, two hundred billion, five hundred twenty million, nine hundred twelve thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •