Base | Representation |
---|---|
bin | 110000000011000011110010… |
… | …000011100000000010000000 |
3 | 1000201012122200212111021201220 |
4 | 300003003302003200002000 |
5 | 210144202043200421404 |
6 | 2025233234324555040 |
7 | 62340052450035261 |
oct | 6003036203400200 |
9 | 1021178625437656 |
10 | 211316451967104 |
11 | 61371893143990 |
12 | 1b84a664252a80 |
13 | 90bb095b02bc3 |
14 | 3a27ab12c0968 |
15 | 1966c5c4294d9 |
hex | c030f20e0080 |
211316451967104 has 128 divisors (see below), whose sum is σ = 612680898862080. Its totient is φ = 63999371842560.
The previous prime is 211316451967031. The next prime is 211316451967121. The reversal of 211316451967104 is 401769154613112.
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, 6497652 + ... + 21560435.
It is an arithmetic number, because the mean of its divisors is an integer number (4786569522360).
Almost surely, 2211316451967104 is an apocalyptic number.
211316451967104 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
211316451967104 is an abundant number, since it is smaller than the sum of its proper divisors (401364446894976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211316451967104 is a wasteful number, since it uses less digits than its factorization.
211316451967104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28059898 (or 28059886 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 51.
The spelling of 211316451967104 in words is "two hundred eleven trillion, three hundred sixteen billion, four hundred fifty-one million, nine hundred sixty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •