Base | Representation |
---|---|
bin | 11010100110101011… |
… | …110010111010111111 |
3 | 2201201211112111222222 |
4 | 122212223302322333 |
5 | 432000433134044 |
6 | 21042334555555 |
7 | 2030620364315 |
oct | 324653627277 |
9 | 81654474888 |
10 | 28566302399 |
11 | 11129a29888 |
12 | 5652968bbb |
13 | 290334861b |
14 | 154dc840b5 |
15 | b22d298ee |
hex | 6a6af2ebf |
28566302399 has 4 divisors (see below), whose sum is σ = 29338364664. Its totient is φ = 27794240136.
The previous prime is 28566302333. The next prime is 28566302417. The reversal of 28566302399 is 99320366582.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28566302399 is a prime.
It is a super-2 number, since 2×285663023992 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 28566302399.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28566302099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 386031077 + ... + 386031150.
It is an arithmetic number, because the mean of its divisors is an integer number (7334591166).
Almost surely, 228566302399 is an apocalyptic number.
28566302399 is a deficient number, since it is larger than the sum of its proper divisors (772062265).
28566302399 is an equidigital number, since it uses as much as digits as its factorization.
28566302399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772062264.
The product of its (nonzero) digits is 4199040, while the sum is 53.
The spelling of 28566302399 in words is "twenty-eight billion, five hundred sixty-six million, three hundred two thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •