Base | Representation |
---|---|
bin | 100100101001000111110001… |
… | …000011000011110110101101 |
3 | 210010121022112201102211201211 |
4 | 210221013301003003312231 |
5 | 132110332442034240433 |
6 | 1330425453054034421 |
7 | 45642046551343360 |
oct | 4451076103036655 |
9 | 703538481384654 |
10 | 161155512024493 |
11 | 4739273a249968 |
12 | 160a9026aa8a11 |
13 | 6bbcb904a326c |
14 | 2bb1d7b40a0d7 |
15 | 13970585608cd |
hex | 9291f10c3dad |
161155512024493 has 16 divisors (see below), whose sum is σ = 184681783519744. Its totient is φ = 137755263409920.
The previous prime is 161155512024467. The next prime is 161155512024569. The reversal of 161155512024493 is 394420215551161.
It is a cyclic number.
It is not a de Polignac number, because 161155512024493 - 229 = 161154975153581 is a prime.
It is a super-2 number, since 2×1611555120244932 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161155512024433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 245929423 + ... + 246583843.
It is an arithmetic number, because the mean of its divisors is an integer number (11542611469984).
Almost surely, 2161155512024493 is an apocalyptic number.
It is an amenable number.
161155512024493 is a deficient number, since it is larger than the sum of its proper divisors (23526271495251).
161155512024493 is an equidigital number, since it uses as much as digits as its factorization.
161155512024493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750652.
The product of its (nonzero) digits is 1296000, while the sum is 49.
The spelling of 161155512024493 in words is "one hundred sixty-one trillion, one hundred fifty-five billion, five hundred twelve million, twenty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •