Base | Representation |
---|---|
bin | 10011010000011… |
… | …00000100010101 |
3 | 102020221120200112 |
4 | 21220030010111 |
5 | 312322431013 |
6 | 24010052405 |
7 | 4000661222 |
oct | 1150140425 |
9 | 366846615 |
10 | 161530133 |
11 | 831a7a86 |
12 | 4611a105 |
13 | 2760807b |
14 | 1764a949 |
15 | e2aaba8 |
hex | 9a0c115 |
161530133 has 2 divisors, whose sum is σ = 161530134. Its totient is φ = 161530132.
The previous prime is 161530111. The next prime is 161530147. The reversal of 161530133 is 331035161.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113060689 + 48469444 = 10633^2 + 6962^2 .
It is an emirp because it is prime and its reverse (331035161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161530133 - 28 = 161529877 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 161530099 and 161530108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161530333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80765066 + 80765067.
It is an arithmetic number, because the mean of its divisors is an integer number (80765067).
Almost surely, 2161530133 is an apocalyptic number.
It is an amenable number.
161530133 is a deficient number, since it is larger than the sum of its proper divisors (1).
161530133 is an equidigital number, since it uses as much as digits as its factorization.
161530133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 161530133 is about 12709.4505388707. The cubic root of 161530133 is about 544.6086273578.
Adding to 161530133 its reverse (331035161), we get a palindrome (492565294).
The spelling of 161530133 in words is "one hundred sixty-one million, five hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •