Base | Representation |
---|---|
bin | 11010001000110001… |
… | …011011010100110101 |
3 | 2200102212020101120110 |
4 | 122020301123110311 |
5 | 424434000242013 |
6 | 20520450453233 |
7 | 2012314664211 |
oct | 321061332465 |
9 | 80385211513 |
10 | 28064462133 |
11 | 109a1725864 |
12 | 5532894219 |
13 | 285339aa16 |
14 | 150336d941 |
15 | ae3c4b2c3 |
hex | 688c5b535 |
28064462133 has 8 divisors (see below), whose sum is σ = 37442661696. Its totient is φ = 18697952000.
The previous prime is 28064462119. The next prime is 28064462177. The reversal of 28064462133 is 33126446082.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28064462133 is a prime.
It is a super-2 number, since 2×280644621332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28064462091 and 28064462100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28064460133) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2916753 + ... + 2926358.
It is an arithmetic number, because the mean of its divisors is an integer number (4680332712).
Almost surely, 228064462133 is an apocalyptic number.
It is an amenable number.
28064462133 is a deficient number, since it is larger than the sum of its proper divisors (9378199563).
28064462133 is a wasteful number, since it uses less digits than its factorization.
28064462133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5844715.
The product of its (nonzero) digits is 165888, while the sum is 39.
The spelling of 28064462133 in words is "twenty-eight billion, sixty-four million, four hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •