Base | Representation |
---|---|
bin | 10101101010010… |
… | …10100011100100 |
3 | 110122220202221000 |
4 | 22311022203210 |
5 | 333004142103 |
6 | 30010353300 |
7 | 4334333634 |
oct | 1265124344 |
9 | 418822830 |
10 | 181709028 |
11 | 9362a756 |
12 | 50a2b830 |
13 | 2b851a47 |
14 | 1a1c06c4 |
15 | 10e44aa3 |
hex | ad4a8e4 |
181709028 has 48 divisors (see below), whose sum is σ = 472144960. Its totient is φ = 60435072.
The previous prime is 181709009. The next prime is 181709029. The reversal of 181709028 is 820907181.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 181708983 and 181709001.
It is not an unprimeable number, because it can be changed into a prime (181709029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54876 + ... + 58092.
Almost surely, 2181709028 is an apocalyptic number.
181709028 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
181709028 is an abundant number, since it is smaller than the sum of its proper divisors (290435932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
181709028 is a wasteful number, since it uses less digits than its factorization.
181709028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3753 (or 3745 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 36.
The square root of 181709028 is about 13479.9491096962. The cubic root of 181709028 is about 566.4029436431.
The spelling of 181709028 in words is "one hundred eighty-one million, seven hundred nine thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •