Base | Representation |
---|---|
bin | 11010001111001011… |
… | …111101101111011001 |
3 | 2200201100202001110112 |
4 | 122033023331233121 |
5 | 430144023112022 |
6 | 20535253254105 |
7 | 2015062514153 |
oct | 321713755731 |
9 | 80640661415 |
10 | 28172082137 |
11 | 10a47451311 |
12 | 5562934335 |
13 | 286c77b9b4 |
14 | 1513785ad3 |
15 | aed4088e2 |
hex | 68f2fdbd9 |
28172082137 has 4 divisors (see below), whose sum is σ = 28172853300. Its totient is φ = 28171310976.
The previous prime is 28172082091. The next prime is 28172082157. The reversal of 28172082137 is 73128027182.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3530617561 + 24641464576 = 59419^2 + 156976^2 .
It is a cyclic number.
It is not a de Polignac number, because 28172082137 - 234 = 10992212953 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28172082094 and 28172082103.
It is not an unprimeable number, because it can be changed into a prime (28172082157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 327908 + ... + 404805.
It is an arithmetic number, because the mean of its divisors is an integer number (7043213325).
Almost surely, 228172082137 is an apocalyptic number.
It is an amenable number.
28172082137 is a deficient number, since it is larger than the sum of its proper divisors (771163).
28172082137 is an equidigital number, since it uses as much as digits as its factorization.
28172082137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771162.
The product of its (nonzero) digits is 75264, while the sum is 41.
The spelling of 28172082137 in words is "twenty-eight billion, one hundred seventy-two million, eighty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •