Base | Representation |
---|---|
bin | 1001110110001010110111… |
… | …01110010000110111110000 |
3 | 2211122221210210102000122022 |
4 | 10323011123232100313300 |
5 | 10314223224030243040 |
6 | 114015001255331012 |
7 | 4363224236510351 |
oct | 473053356206760 |
9 | 84587723360568 |
10 | 21652468993520 |
11 | 69988402a4992 |
12 | 2518488080a68 |
13 | c10a85640ab1 |
14 | 54bdb1137d28 |
15 | 27836c9636b5 |
hex | 13b15bb90df0 |
21652468993520 has 40 divisors (see below), whose sum is σ = 50426033911200. Its totient is φ = 8646528500480.
The previous prime is 21652468993471. The next prime is 21652468993523. The reversal of 21652468993520 is 2539986425612.
It is a happy number.
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 (21652468993523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225875171 + ... + 225971010.
It is an arithmetic number, because the mean of its divisors is an integer number (1260650847780).
Almost surely, 221652468993520 is an apocalyptic number.
21652468993520 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21652468993520 is an abundant number, since it is smaller than the sum of its proper divisors (28773564917680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21652468993520 is a wasteful number, since it uses less digits than its factorization.
21652468993520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451846793 (or 451846787 counting only the distinct ones).
The product of its (nonzero) digits is 55987200, while the sum is 62.
The spelling of 21652468993520 in words is "twenty-one trillion, six hundred fifty-two billion, four hundred sixty-eight million, nine hundred ninety-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •