Base | Representation |
---|---|
bin | 11010100000000001… |
… | …010101000101100000 |
3 | 2201110001011201100000 |
4 | 122200001111011200 |
5 | 431233323204343 |
6 | 21023302500000 |
7 | 2025062213625 |
oct | 324001250540 |
9 | 81401151300 |
10 | 28454506848 |
11 | 11081911169 |
12 | 5621434600 |
13 | 28b6134c01 |
14 | 153d0a234c |
15 | b180e4ed3 |
hex | 6a0055160 |
28454506848 has 72 divisors (see below), whose sum is σ = 83914471368. Its totient is φ = 9484833024.
The previous prime is 28454506763. The next prime is 28454506853. The reversal of 28454506848 is 84860545482.
28454506848 is a `hidden beast` number, since 2 + 8 + 4 + 54 + 506 + 84 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 28454506794 and 28454506803.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1821861 + ... + 1837412.
It is an arithmetic number, because the mean of its divisors is an integer number (1165478769).
Almost surely, 228454506848 is an apocalyptic number.
It is an amenable number.
28454506848 is an abundant number, since it is smaller than the sum of its proper divisors (55459964520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28454506848 is an equidigital number, since it uses as much as digits as its factorization.
28454506848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3659298 (or 3659278 counting only the distinct ones).
The product of its (nonzero) digits is 9830400, while the sum is 54.
The spelling of 28454506848 in words is "twenty-eight billion, four hundred fifty-four million, five hundred six thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •