Base | Representation |
---|---|
bin | 10100100000111… |
… | …00001100111101 |
3 | 102222210200002201 |
4 | 22100130030331 |
5 | 323023110411 |
6 | 25024151501 |
7 | 4156446511 |
oct | 1220341475 |
9 | 388720081 |
10 | 172081981 |
11 | 89154815 |
12 | 49768591 |
13 | 29860b76 |
14 | 18bd6141 |
15 | 101923c1 |
hex | a41c33d |
172081981 has 2 divisors, whose sum is σ = 172081982. Its totient is φ = 172081980.
The previous prime is 172081957. The next prime is 172082003. The reversal of 172081981 is 189180271.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136679481 + 35402500 = 11691^2 + 5950^2 .
It is a cyclic number.
It is not a de Polignac number, because 172081981 - 213 = 172073789 is a prime.
It is a super-2 number, since 2×1720819812 = 59224416369768722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 172081981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (172081901) 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 as a sum of consecutive naturals, namely, 86040990 + 86040991.
It is an arithmetic number, because the mean of its divisors is an integer number (86040991).
Almost surely, 2172081981 is an apocalyptic number.
It is an amenable number.
172081981 is a deficient number, since it is larger than the sum of its proper divisors (1).
172081981 is an equidigital number, since it uses as much as digits as its factorization.
172081981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 37.
The square root of 172081981 is about 13118.0021725871. The cubic root of 172081981 is about 556.2181193528.
The spelling of 172081981 in words is "one hundred seventy-two million, eighty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •