Base | Representation |
---|---|
bin | 1001011000111100101… |
… | …1110010110010001011 |
3 | 120102101101120001202122 |
4 | 2112033023302302023 |
5 | 10120333400222220 |
6 | 202035122121455 |
7 | 14440363401140 |
oct | 2261713626213 |
9 | 512341501678 |
10 | 161316023435 |
11 | 62460765036 |
12 | 273204b028b |
13 | 1229aac5008 |
14 | 7b446063c7 |
15 | 42e2295425 |
hex | 258f2f2c8b |
161316023435 has 8 divisors (see below), whose sum is σ = 221233403616. Its totient is φ = 110616701760.
The previous prime is 161316023387. The next prime is 161316023441. The reversal of 161316023435 is 534320613161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 161316023435 - 218 = 161315761291 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 4609029241 = 161316023435 / (1 + 6 + 1 + 3 + 1 + 6 + 0 + 2 + 3 + 4 + 3 + 5).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 161316023395 and 161316023404.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2304514586 + ... + 2304514655.
It is an arithmetic number, because the mean of its divisors is an integer number (27654175452).
Almost surely, 2161316023435 is an apocalyptic number.
161316023435 is a deficient number, since it is larger than the sum of its proper divisors (59917380181).
161316023435 is an equidigital number, since it uses as much as digits as its factorization.
161316023435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4609029253.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 161316023435 its reverse (534320613161), we get a palindrome (695636636596).
The spelling of 161316023435 in words is "one hundred sixty-one billion, three hundred sixteen million, twenty-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.270 sec. • engine limits •