Base | Representation |
---|---|
bin | 1100101111101011110111… |
… | …01110110000011011000000 |
3 | 10200020022220112002122122201 |
4 | 12113311323232300123000 |
5 | 12133142224242222203 |
6 | 135335145550442544 |
7 | 5621602452506233 |
oct | 627657356603300 |
9 | 120208815078581 |
10 | 28026737460928 |
11 | 8a26088706418 |
12 | 3187929803454 |
13 | 1283baa37589b |
14 | 6cc70391b41a |
15 | 33908e2c1e1d |
hex | 197d7bbb06c0 |
28026737460928 has 112 divisors (see below), whose sum is σ = 58745649945600. Its totient is φ = 13229868810240.
The previous prime is 28026737460811. The next prime is 28026737460971. The reversal of 28026737460928 is 82906473762082.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a self number, because there is not a number n which added to its sum of digits gives 28026737460928.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 464843008 + ... + 464903296.
Almost surely, 228026737460928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28026737460928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29372824972800).
28026737460928 is an abundant number, since it is smaller than the sum of its proper divisors (30718912484672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28026737460928 is a wasteful number, since it uses less digits than its factorization.
28026737460928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61638 (or 61628 counting only the distinct ones).
The product of its (nonzero) digits is 97542144, while the sum is 64.
The spelling of 28026737460928 in words is "twenty-eight trillion, twenty-six billion, seven hundred thirty-seven million, four hundred sixty thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •