Base | Representation |
---|---|
bin | 110000000010111011010101… |
… | …000010000111101111010000 |
3 | 1000201011210021021211021020011 |
4 | 300002323111002013233100 |
5 | 210144030001013202400 |
6 | 2025225133520524304 |
7 | 62336311512151066 |
oct | 6002732502075720 |
9 | 1021153237737204 |
10 | 211307375131600 |
11 | 61368a55543040 |
12 | 1b848950480694 |
13 | 90ba27a45ca17 |
14 | 3a2748d9c8036 |
15 | 19668ca6218ba |
hex | c02ed5087bd0 |
211307375131600 has 240 divisors, whose sum is σ = 590345036928000. Its totient is φ = 71873428723200.
The previous prime is 211307375131579. The next prime is 211307375131663. The reversal of 211307375131600 is 6131573703112.
It is a super-2 number, since 2×2113073751316002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9393070 + ... + 22601869.
It is an arithmetic number, because the mean of its divisors is an integer number (2459770987200).
Almost surely, 2211307375131600 is an apocalyptic number.
211307375131600 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211307375131600 is an abundant number, since it is smaller than the sum of its proper divisors (379037661796400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211307375131600 is a wasteful number, since it uses less digits than its factorization.
211307375131600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31995066 (or 31995055 counting only the distinct ones).
The product of its (nonzero) digits is 79380, while the sum is 40.
The spelling of 211307375131600 in words is "two hundred eleven trillion, three hundred seven billion, three hundred seventy-five million, one hundred thirty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •