Base | Representation |
---|---|
bin | 11010110010011010… |
… | …110011010100000101 |
3 | 2202020112222122021021 |
4 | 122302122303110011 |
5 | 432401333033044 |
6 | 21114050351141 |
7 | 2035530642403 |
oct | 326232632405 |
9 | 82215878237 |
10 | 28763174149 |
11 | 11220075506 |
12 | 56a888b4b1 |
13 | 2935078a98 |
14 | 156c090473 |
15 | b35266e84 |
hex | 6b26b3505 |
28763174149 has 4 divisors (see below), whose sum is σ = 30277025440. Its totient is φ = 27249322860.
The previous prime is 28763174107. The next prime is 28763174287. The reversal of 28763174149 is 94147136782.
It is a happy number.
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-28763174149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28763174096 and 28763174105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28763174549) 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 3 ways as a sum of consecutive naturals, for example, 756925617 + ... + 756925654.
It is an arithmetic number, because the mean of its divisors is an integer number (7569256360).
Almost surely, 228763174149 is an apocalyptic number.
It is an amenable number.
28763174149 is a deficient number, since it is larger than the sum of its proper divisors (1513851291).
28763174149 is a wasteful number, since it uses less digits than its factorization.
28763174149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1513851290.
The product of its digits is 2032128, while the sum is 52.
The spelling of 28763174149 in words is "twenty-eight billion, seven hundred sixty-three million, one hundred seventy-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •