Base | Representation |
---|---|
bin | 1001011000000000010… |
… | …1001000100100100111 |
3 | 120101201201201210211011 |
4 | 2112000011020210213 |
5 | 10114324012310211 |
6 | 201554030523051 |
7 | 14431165451020 |
oct | 2260005104447 |
9 | 511651653734 |
10 | 161062619431 |
11 | 6234071693a |
12 | 2726b666487 |
13 | 1225a46010c |
14 | 7b1cac1c47 |
15 | 42c9ddc921 |
hex | 2580148927 |
161062619431 has 8 divisors (see below), whose sum is σ = 186818902400. Its totient is φ = 135993170808.
The previous prime is 161062619423. The next prime is 161062619519. The reversal of 161062619431 is 134916260161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 161062619431 - 23 = 161062619423 is a prime.
It is a super-2 number, since 2×1610626194312 (a number of 23 digits) 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 (161062613431) 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 in 7 ways as a sum of consecutive naturals, for example, 171708081 + ... + 171709018.
It is an arithmetic number, because the mean of its divisors is an integer number (23352362800).
Almost surely, 2161062619431 is an apocalyptic number.
161062619431 is a deficient number, since it is larger than the sum of its proper divisors (25756282969).
161062619431 is an equidigital number, since it uses as much as digits as its factorization.
161062619431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343417173.
The product of its (nonzero) digits is 46656, while the sum is 40.
Adding to 161062619431 its reverse (134916260161), we get a palindrome (295978879592).
The spelling of 161062619431 in words is "one hundred sixty-one billion, sixty-two million, six hundred nineteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •