Base | Representation |
---|---|
bin | 1001011001110011010… |
… | …1110001110001000101 |
3 | 120102222100200001011201 |
4 | 2112130311301301011 |
5 | 10121321023230000 |
6 | 202113544502501 |
7 | 14446144655335 |
oct | 2263465616105 |
9 | 512870601151 |
10 | 161545133125 |
11 | 6256901a592 |
12 | 2738517aa31 |
13 | 12306401c8c |
14 | 7b66c050c5 |
15 | 430744e96a |
hex | 259cd71c45 |
161545133125 has 10 divisors (see below), whose sum is σ = 201866799134. Its totient is φ = 129236106000.
The previous prime is 161545133119. The next prime is 161545133179. The reversal of 161545133125 is 521331545161.
161545133125 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 5 ways, for example, as 22909546881 + 138635586244 = 151359^2 + 372338^2 .
It is not a de Polignac number, because 161545133125 - 29 = 161545132613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 129235482 + ... + 129236731.
Almost surely, 2161545133125 is an apocalyptic number.
It is an amenable number.
161545133125 is a deficient number, since it is larger than the sum of its proper divisors (40321666009).
161545133125 is an frugal number, since it uses more digits than its factorization.
161545133125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258472233 (or 258472218 counting only the distinct ones).
The product of its digits is 54000, while the sum is 37.
Adding to 161545133125 its reverse (521331545161), we get a palindrome (682876678286).
The spelling of 161545133125 in words is "one hundred sixty-one billion, five hundred forty-five million, one hundred thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •