Base | Representation |
---|---|
bin | 110000010100110001001101… |
… | …101011110101110001110000 |
3 | 1000212112000000121020200201122 |
4 | 300110301031223311301300 |
5 | 210324122014020411420 |
6 | 2032004305334121412 |
7 | 62524015251200261 |
oct | 6024611553656160 |
9 | 1025460017220648 |
10 | 212533465013360 |
11 | 617a0a3329a487 |
12 | 1ba064ab4b0268 |
13 | 9178a86ccb28a |
14 | 3a6a963122968 |
15 | 198873aa17725 |
hex | c14c4daf5c70 |
212533465013360 has 40 divisors (see below), whose sum is σ = 494141392632096. Its totient is φ = 85013199084800.
The previous prime is 212533465013357. The next prime is 212533465013369. The reversal of 212533465013360 is 63310564335212.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212533465013369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37097285 + ... + 42441435.
Almost surely, 2212533465013360 is an apocalyptic number.
212533465013360 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212533465013360 is an abundant number, since it is smaller than the sum of its proper divisors (281607927618736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212533465013360 is a wasteful number, since it uses less digits than its factorization.
212533465013360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5841281 (or 5841275 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 44.
The spelling of 212533465013360 in words is "two hundred twelve trillion, five hundred thirty-three billion, four hundred sixty-five million, thirteen thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •