Base | Representation |
---|---|
bin | 10011000001110101… |
… | …01001000110000000 |
3 | 222100222001111200102 |
4 | 21200322221012000 |
5 | 131410233420000 |
6 | 4405414341532 |
7 | 511105613216 |
oct | 114072510600 |
9 | 28328044612 |
10 | 10215920000 |
11 | 43726909a0 |
12 | 1b9135a8a8 |
13 | c6a659aa0 |
14 | 6ccacacb6 |
15 | 3ebd0e3d5 |
hex | 260ea9180 |
10215920000 has 640 divisors, whose sum is σ = 32119718400. Its totient is φ = 3179520000.
The previous prime is 10215919999. The next prime is 10215920027. The reversal of 10215920000 is 2951201.
It is a tau number, because it is divible by the number of its divisors (640).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 217359977 + ... + 217360023.
It is an arithmetic number, because the mean of its divisors is an integer number (50187060).
Almost surely, 210215920000 is an apocalyptic number.
10215920000 is a gapful number since it is divisible by the number (10) 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 10215920000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16059859200).
10215920000 is an abundant number, since it is smaller than the sum of its proper divisors (21903798400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10215920000 is a wasteful number, since it uses less digits than its factorization.
10215920000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124 (or 97 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 20.
The spelling of 10215920000 in words is "ten billion, two hundred fifteen million, nine hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •