Base | Representation |
---|---|
bin | 11010100110100011… |
… | …001110110100001100 |
3 | 2201201200022110101020 |
4 | 122212203032310030 |
5 | 431444344313411 |
6 | 21042214514140 |
7 | 2030562324102 |
oct | 324643166414 |
9 | 81650273336 |
10 | 28564057356 |
11 | 1112873607a |
12 | 5652065950 |
13 | 2902a407b3 |
14 | 154d85bc72 |
15 | b22a34606 |
hex | 6a68ced0c |
28564057356 has 36 divisors (see below), whose sum is σ = 70575988392. Its totient is φ = 8960515584.
The previous prime is 28564057337. The next prime is 28564057409. The reversal of 28564057356 is 65375046582.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 28564057299 and 28564057308.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 2408016 + ... + 2419848.
It is an arithmetic number, because the mean of its divisors is an integer number (1960444122).
Almost surely, 228564057356 is an apocalyptic number.
It is an amenable number.
28564057356 is an abundant number, since it is smaller than the sum of its proper divisors (42011931036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28564057356 is an equidigital number, since it uses as much as digits as its factorization.
28564057356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23690 (or 11855 counting only the distinct ones).
The product of its (nonzero) digits is 6048000, while the sum is 51.
Multiplying 28564057356 by its sum of digits (51), we get a square (1456766925156 = 12069662).
28564057356 divided by its sum of digits (51) gives a square (560079556 = 236662).
The spelling of 28564057356 in words is "twenty-eight billion, five hundred sixty-four million, fifty-seven thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •