Base | Representation |
---|---|
bin | 10011001111001… |
… | …01011010000101 |
3 | 102020122112110122 |
4 | 21213211122011 |
5 | 312302344111 |
6 | 24002431325 |
7 | 3666431444 |
oct | 1147453205 |
9 | 366575418 |
10 | 161371781 |
11 | 830aa00a |
12 | 46062545 |
13 | 27580c7c |
14 | 17608d5b |
15 | e278cdb |
hex | 99e5685 |
161371781 has 4 divisors (see below), whose sum is σ = 161623392. Its totient is φ = 161120172.
The previous prime is 161371759. The next prime is 161371783. The reversal of 161371781 is 187173161.
161371781 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 161371781 - 210 = 161370757 is a prime.
It is a super-2 number, since 2×1613717812 = 52081703406223922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161371783) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 124841 + ... + 126126.
It is an arithmetic number, because the mean of its divisors is an integer number (40405848).
Almost surely, 2161371781 is an apocalyptic number.
It is an amenable number.
161371781 is a deficient number, since it is larger than the sum of its proper divisors (251611).
161371781 is an equidigital number, since it uses as much as digits as its factorization.
161371781 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251610.
The product of its digits is 7056, while the sum is 35.
The square root of 161371781 is about 12703.2193163780. The cubic root of 161371781 is about 544.4306047186.
The spelling of 161371781 in words is "one hundred sixty-one million, three hundred seventy-one thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •