Base | Representation |
---|---|
bin | 11010001100111001… |
… | …010111010110011100 |
3 | 2200121200102121001020 |
4 | 122030321113112130 |
5 | 430104203324433 |
6 | 20531401444140 |
7 | 2014115044440 |
oct | 321471272634 |
9 | 80550377036 |
10 | 28133651868 |
11 | 10a27793063 |
12 | 5551aa0650 |
13 | 28648147aa |
14 | 150c620820 |
15 | ae9d66cb3 |
hex | 68ce5759c |
28133651868 has 24 divisors (see below), whose sum is σ = 75023071872. Its totient is φ = 8038186224.
The previous prime is 28133651857. The next prime is 28133651869. The reversal of 28133651868 is 86815633182.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 28133651868.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28133651869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167462130 + ... + 167462297.
It is an arithmetic number, because the mean of its divisors is an integer number (3125961328).
Almost surely, 228133651868 is an apocalyptic number.
28133651868 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
28133651868 is an abundant number, since it is smaller than the sum of its proper divisors (46889420004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28133651868 is a wasteful number, since it uses less digits than its factorization.
28133651868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334924441 (or 334924439 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 51.
The spelling of 28133651868 in words is "twenty-eight billion, one hundred thirty-three million, six hundred fifty-one thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •