Base | Representation |
---|---|
bin | 11010010110100111… |
… | …001110010111110101 |
3 | 2201001001011201001020 |
4 | 122112213032113311 |
5 | 430422421344121 |
6 | 20555503451353 |
7 | 2021134500162 |
oct | 322647162765 |
9 | 81031151036 |
10 | 28296668661 |
11 | 11000805a88 |
12 | 55985b6b59 |
13 | 288c520431 |
14 | 1526137069 |
15 | b093181c6 |
hex | 6969ce5f5 |
28296668661 has 8 divisors (see below), whose sum is σ = 38062776000. Its totient is φ = 18697503552.
The previous prime is 28296668651. The next prime is 28296668671. The reversal of 28296668661 is 16686669282.
It is an interprime number because it is at equal distance from previous prime (28296668651) and next prime (28296668671).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28296668661 - 214 = 28296652277 is a prime.
It is a super-3 number, since 3×282966686613 (a number of 32 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 28296668595 and 28296668604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28296668611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41735161 + ... + 41735838.
It is an arithmetic number, because the mean of its divisors is an integer number (4757847000).
Almost surely, 228296668661 is an apocalyptic number.
It is an amenable number.
28296668661 is a deficient number, since it is larger than the sum of its proper divisors (9766107339).
28296668661 is a wasteful number, since it uses less digits than its factorization.
28296668661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83471115.
The product of its digits is 17915904, while the sum is 60.
The spelling of 28296668661 in words is "twenty-eight billion, two hundred ninety-six million, six hundred sixty-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •