Base | Representation |
---|---|
bin | 10101100111010… |
… | …10101000100101 |
3 | 110122011210222100 |
4 | 22303222220211 |
5 | 332404104013 |
6 | 25554122313 |
7 | 4331106315 |
oct | 1263525045 |
9 | 418153870 |
10 | 181316133 |
11 | 93391549 |
12 | 50880399 |
13 | 2b744c6b |
14 | 1a11b445 |
15 | 10db8473 |
hex | aceaa25 |
181316133 has 6 divisors (see below), whose sum is σ = 261901094. Its totient is φ = 120877416.
The previous prime is 181316131. The next prime is 181316197. The reversal of 181316133 is 331613181.
181316133 is a `hidden beast` number, since 18 + 1 + 31 + 613 + 3 = 666.
181316133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 140138244 + 41177889 = 11838^2 + 6417^2 .
It is not a de Polignac number, because 181316133 - 21 = 181316131 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 181316097 and 181316106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (181316131) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10073110 + ... + 10073127.
Almost surely, 2181316133 is an apocalyptic number.
It is an amenable number.
181316133 is a deficient number, since it is larger than the sum of its proper divisors (80584961).
181316133 is a wasteful number, since it uses less digits than its factorization.
181316133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20146243 (or 20146240 counting only the distinct ones).
The product of its digits is 1296, while the sum is 27.
The square root of 181316133 is about 13465.3679117951. The cubic root of 181316133 is about 565.9944196947.
The spelling of 181316133 in words is "one hundred eighty-one million, three hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •