Base | Representation |
---|---|
bin | 1101000001000000011110… |
… | …11001100100011010111000 |
3 | 10202100020011211211202101110 |
4 | 12200200033121210122320 |
5 | 12222420143111442220 |
6 | 140512421223120320 |
7 | 6012602604265554 |
oct | 640401731443270 |
9 | 122306154752343 |
10 | 28621920421560 |
11 | 91355409a6a44 |
12 | 32631532a30a0 |
13 | 12c8060043b2b |
14 | 70d446128864 |
15 | 3497c62c8be0 |
hex | 1a080f6646b8 |
28621920421560 has 64 divisors (see below), whose sum is σ = 85867039601280. Its totient is φ = 7632398482560.
The previous prime is 28621920421543. The next prime is 28621920421583. The reversal of 28621920421560 is 6512402912682.
It is a super-2 number, since 2×286219204215602 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6477699 + ... + 9960141.
It is an arithmetic number, because the mean of its divisors is an integer number (1341672493770).
Almost surely, 228621920421560 is an apocalyptic number.
28621920421560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
28621920421560 is an abundant number, since it is smaller than the sum of its proper divisors (57245119179720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28621920421560 is a wasteful number, since it uses less digits than its factorization.
28621920421560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3550948 (or 3550944 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 48.
The spelling of 28621920421560 in words is "twenty-eight trillion, six hundred twenty-one billion, nine hundred twenty million, four hundred twenty-one thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •