Base | Representation |
---|---|
bin | 11010100001100011… |
… | …100010101000100000 |
3 | 2201111211121201122202 |
4 | 122201203202220200 |
5 | 431311421034243 |
6 | 21030022352332 |
7 | 2025524102654 |
oct | 324143425040 |
9 | 81454551582 |
10 | 28480252448 |
11 | 110953a621a |
12 | 5629b8b6a8 |
13 | 28bb57a5ab |
14 | 1542684a64 |
15 | b1a4cd4b8 |
hex | 6a18e2a20 |
28480252448 has 18 divisors (see below), whose sum is σ = 56072376549. Its totient is φ = 14239648896.
The previous prime is 28480252447. The next prime is 28480252543. The reversal of 28480252448 is 84425208482.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 28322197264 + 158055184 = 168292^2 + 12572^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=119332.
It is a super-2 number, since 2×284802524482 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28480252447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 939740 + ... + 969572.
Almost surely, 228480252448 is an apocalyptic number.
It is an amenable number.
28480252448 is a deficient number, since it is larger than the sum of its proper divisors (27592124101).
28480252448 is an frugal number, since it uses more digits than its factorization.
28480252448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59676 (or 29835 counting only the distinct ones).
The product of its (nonzero) digits is 1310720, while the sum is 47.
The spelling of 28480252448 in words is "twenty-eight billion, four hundred eighty million, two hundred fifty-two thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •