Base | Representation |
---|---|
bin | 1100011010110111000… |
… | …0101110000101000000 |
3 | 202101202000201022212000 |
4 | 3012231300232011000 |
5 | 11443434332040040 |
6 | 242004210104000 |
7 | 21262321260306 |
oct | 3065560560500 |
9 | 671660638760 |
10 | 213368627520 |
11 | 825420339a4 |
12 | 3542887b000 |
13 | 17174b99869 |
14 | a4817a6276 |
15 | 583be3e130 |
hex | 31adc2e140 |
213368627520 has 448 divisors, whose sum is σ = 780363590400. Its totient is φ = 54817136640.
The previous prime is 213368627509. The next prime is 213368627617. The reversal of 213368627520 is 25726863312.
213368627520 is a `hidden beast` number, since 2 + 1 + 3 + 3 + 68 + 62 + 7 + 520 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 219740635 + ... + 219741605.
Almost surely, 2213368627520 is an apocalyptic number.
213368627520 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 213368627520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (390181795200).
213368627520 is an abundant number, since it is smaller than the sum of its proper divisors (566994962880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213368627520 is a wasteful number, since it uses less digits than its factorization.
213368627520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903 (or 1887 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The spelling of 213368627520 in words is "two hundred thirteen billion, three hundred sixty-eight million, six hundred twenty-seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •