Base | Representation |
---|---|
bin | 11010100000101011… |
… | …110111001010100001 |
3 | 2201110211011011202101 |
4 | 122200223313022201 |
5 | 431244202001411 |
6 | 21024341450401 |
7 | 2025256042063 |
oct | 324053671241 |
9 | 81424134671 |
10 | 28465656481 |
11 | 11088137039 |
12 | 5625110a01 |
13 | 28b8539b22 |
14 | 1540765733 |
15 | b190988c1 |
hex | 6a0af72a1 |
28465656481 has 8 divisors (see below), whose sum is σ = 28507245120. Its totient is φ = 28424092752.
The previous prime is 28465656449. The next prime is 28465656487. The reversal of 28465656481 is 18465656482.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28465656481 - 25 = 28465656449 is a prime.
It is a super-2 number, since 2×284656564812 (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 (28465656487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3904866 + ... + 3912148.
It is an arithmetic number, because the mean of its divisors is an integer number (3563405640).
Almost surely, 228465656481 is an apocalyptic number.
It is an amenable number.
28465656481 is a deficient number, since it is larger than the sum of its proper divisors (41588639).
28465656481 is an equidigital number, since it uses as much as digits as its factorization.
28465656481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12455.
The product of its digits is 11059200, while the sum is 55.
Subtracting from 28465656481 its reverse (18465656482), we obtain a palindrome (9999999999).
The spelling of 28465656481 in words is "twenty-eight billion, four hundred sixty-five million, six hundred fifty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •