Base | Representation |
---|---|
bin | 1001011010100000001… |
… | …0111011100100100011 |
3 | 120110110110102022010121 |
4 | 2112220002323210203 |
5 | 10122212140134111 |
6 | 202144342141111 |
7 | 14453616632620 |
oct | 2265002734443 |
9 | 513413368117 |
10 | 161733130531 |
11 | 62655154845 |
12 | 27418121797 |
13 | 1233634604b |
14 | 7b83b81347 |
15 | 4318bd7871 |
hex | 25a80bb923 |
161733130531 has 4 divisors (see below), whose sum is σ = 184837863472. Its totient is φ = 138628397592.
The previous prime is 161733130523. The next prime is 161733130561. The reversal of 161733130531 is 135031337161.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 161733130531 - 23 = 161733130523 is a prime.
It is a super-2 number, since 2×1617331305312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161733130561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11552366460 + ... + 11552366473.
It is an arithmetic number, because the mean of its divisors is an integer number (46209465868).
Almost surely, 2161733130531 is an apocalyptic number.
161733130531 is a deficient number, since it is larger than the sum of its proper divisors (23104732941).
161733130531 is an equidigital number, since it uses as much as digits as its factorization.
161733130531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23104732940.
The product of its (nonzero) digits is 17010, while the sum is 34.
Adding to 161733130531 its reverse (135031337161), we get a palindrome (296764467692).
The spelling of 161733130531 in words is "one hundred sixty-one billion, seven hundred thirty-three million, one hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •