Base | Representation |
---|---|
bin | 100100100111000010010000… |
… | …101011010101110111101101 |
3 | 210010002121112100201011111112 |
4 | 210213002100223111313231 |
5 | 132101010401241221300 |
6 | 1330235544334001405 |
7 | 45625513312145255 |
oct | 4447022053256755 |
9 | 703077470634445 |
10 | 161012161273325 |
11 | 4733796850788a |
12 | 1608529b046265 |
13 | 6bac4c666c98b |
14 | 2ba905cb90965 |
15 | 13934685b3e35 |
hex | 927090ad5ded |
161012161273325 has 24 divisors (see below), whose sum is σ = 199858770813000. Its totient is φ = 128678344416000.
The previous prime is 161012161273297. The next prime is 161012161273339. The reversal of 161012161273325 is 523372161210161.
161012161273325 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 14833566964969 + 146178594308356 = 3851437^2 + 12090434^2 .
It is not a de Polignac number, because 161012161273325 - 216 = 161012161207789 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 225864551 + ... + 226576299.
It is an arithmetic number, because the mean of its divisors is an integer number (8327448783875).
Almost surely, 2161012161273325 is an apocalyptic number.
It is an amenable number.
161012161273325 is a deficient number, since it is larger than the sum of its proper divisors (38846609539675).
161012161273325 is a wasteful number, since it uses less digits than its factorization.
161012161273325 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720977 (or 720972 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 41.
The spelling of 161012161273325 in words is "one hundred sixty-one trillion, twelve billion, one hundred sixty-one million, two hundred seventy-three thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •