Base | Representation |
---|---|
bin | 11010000111101001… |
… | …111101000111010001 |
3 | 2200101112222111122120 |
4 | 122013221331013101 |
5 | 424414201214121 |
6 | 20514541124453 |
7 | 2011666511325 |
oct | 320751750721 |
9 | 80345874576 |
10 | 28045726161 |
11 | 10992099192 |
12 | 5528559729 |
13 | 284c53aa4b |
14 | 1500a93985 |
15 | ae2299bc6 |
hex | 687a7d1d1 |
28045726161 has 8 divisors (see below), whose sum is σ = 37400513760. Its totient is φ = 18694044672.
The previous prime is 28045726153. The next prime is 28045726187. The reversal of 28045726161 is 16162754082.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 28045726161 - 23 = 28045726153 is a prime.
It is a super-3 number, since 3×280457261613 (a number of 32 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (28045727161) 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, 755376 + ... + 791633.
It is an arithmetic number, because the mean of its divisors is an integer number (4675064220).
Almost surely, 228045726161 is an apocalyptic number.
It is an amenable number.
28045726161 is a deficient number, since it is larger than the sum of its proper divisors (9354787599).
28045726161 is a wasteful number, since it uses less digits than its factorization.
28045726161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1553055.
The product of its (nonzero) digits is 161280, while the sum is 42.
The spelling of 28045726161 in words is "twenty-eight billion, forty-five million, seven hundred twenty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •