Base | Representation |
---|---|
bin | 1001110011111010101100… |
… | …00010011010011111000000 |
3 | 2211101120000022122011020112 |
4 | 10321331112002122133000 |
5 | 10311441212413414102 |
6 | 113515240410130452 |
7 | 4354514126566640 |
oct | 471752602323700 |
9 | 84346008564215 |
10 | 21575064201152 |
11 | 6968a2a30a800 |
12 | 2505485420a28 |
13 | c0669b0917c7 |
14 | 54834ad14520 |
15 | 27633c22a252 |
hex | 139f5609a7c0 |
21575064201152 has 168 divisors, whose sum is σ = 54429625423488. Its totient is φ = 8304591905280.
The previous prime is 21575064201137. The next prime is 21575064201221. The reversal of 21575064201152 is 25110246057512.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2101643 + ... + 6896885.
It is an arithmetic number, because the mean of its divisors is an integer number (323985865616).
Almost surely, 221575064201152 is an apocalyptic number.
21575064201152 is a gapful number since it is divisible by the number (22) 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 21575064201152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27214812711744).
21575064201152 is an abundant number, since it is smaller than the sum of its proper divisors (32854561222336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21575064201152 is a wasteful number, since it uses less digits than its factorization.
21575064201152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4795367 (or 4795346 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 41.
The spelling of 21575064201152 in words is "twenty-one trillion, five hundred seventy-five billion, sixty-four million, two hundred one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •