Base | Representation |
---|---|
bin | 1101000101001001100111… |
… | …01110011111110000000000 |
3 | 10202211211121000001000000000 |
4 | 12202210303232133300000 |
5 | 12232233203013324000 |
6 | 141102042000000000 |
7 | 6026102162150400 |
oct | 642446356376000 |
9 | 122754530030000 |
10 | 28764263808000 |
11 | 918a946044a96 |
12 | 3286859900000 |
13 | 13085c625c006 |
14 | 7162aaa7a800 |
15 | 34d357adc000 |
hex | 1a2933b9fc00 |
28764263808000 has 2640 divisors, whose sum is σ = 125750103377184. Its totient is φ = 6546471321600.
The previous prime is 28764263807959. The next prime is 28764263808011. The reversal of 28764263808000 is 80836246782.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 123451775884 + ... + 123451776116.
Almost surely, 228764263808000 is an apocalyptic number.
28764263808000 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 28764263808000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62875051688592).
28764263808000 is an abundant number, since it is smaller than the sum of its proper divisors (96985839569184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28764263808000 is an frugal number, since it uses more digits than its factorization.
28764263808000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309 (or 250 counting only the distinct ones).
The product of its (nonzero) digits is 6193152, while the sum is 54.
The spelling of 28764263808000 in words is "twenty-eight trillion, seven hundred sixty-four billion, two hundred sixty-three million, eight hundred eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •