Base | Representation |
---|---|
bin | 10011101000110001… |
… | …011111100010010000 |
3 | 2000102110102222112000 |
4 | 103220301133202100 |
5 | 321140300020040 |
6 | 13404132034000 |
7 | 1344336611310 |
oct | 235061374220 |
9 | 60373388460 |
10 | 21085157520 |
11 | 8a40026a19 |
12 | 4105462900 |
13 | 1cb045c88b |
14 | 104047d440 |
15 | 83616e130 |
hex | 4e8c5f890 |
21085157520 has 320 divisors, whose sum is σ = 84366266880. Its totient is φ = 4740249600.
The previous prime is 21085157497. The next prime is 21085157537. The reversal of 21085157520 is 2575158012.
21085157520 is a `hidden beast` number, since 2 + 1 + 0 + 85 + 1 + 57 + 520 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 910890 + ... + 933750.
It is an arithmetic number, because the mean of its divisors is an integer number (263644584).
Almost surely, 221085157520 is an apocalyptic number.
21085157520 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 21085157520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42183133440).
21085157520 is an abundant number, since it is smaller than the sum of its proper divisors (63281109360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21085157520 is a wasteful number, since it uses less digits than its factorization.
21085157520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22951 (or 22939 counting only the distinct ones).
The product of its (nonzero) digits is 28000, while the sum is 36.
The spelling of 21085157520 in words is "twenty-one billion, eighty-five million, one hundred fifty-seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •