Base | Representation |
---|---|
bin | 110111000011… |
… | …0110011010001 |
3 | 2000022102112211 |
4 | 1232012303101 |
5 | 24342114242 |
6 | 2510352121 |
7 | 500223502 |
oct | 156066321 |
9 | 60272484 |
10 | 28863697 |
11 | 153247a5 |
12 | 97bb641 |
13 | 5c97a15 |
14 | 3b94ba9 |
15 | 2802317 |
hex | 1b86cd1 |
28863697 has 4 divisors (see below), whose sum is σ = 29794816. Its totient is φ = 27932580.
The previous prime is 28863683. The next prime is 28863719. The reversal of 28863697 is 79636882.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28863697 is a prime.
It is a super-2 number, since 2×288636972 = 1666226009015618, which 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 28863697.
It is not an unprimeable number, because it can be changed into a prime (28863647) 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 3 ways as a sum of consecutive naturals, for example, 465513 + ... + 465574.
It is an arithmetic number, because the mean of its divisors is an integer number (7448704).
Almost surely, 228863697 is an apocalyptic number.
It is an amenable number.
28863697 is a deficient number, since it is larger than the sum of its proper divisors (931119).
28863697 is an equidigital number, since it uses as much as digits as its factorization.
28863697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 931118.
The product of its digits is 870912, while the sum is 49.
The square root of 28863697 is about 5372.4944858045. The cubic root of 28863697 is about 306.7495862468.
The spelling of 28863697 in words is "twenty-eight million, eight hundred sixty-three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •