Base | Representation |
---|---|
bin | 100101010011010000110100… |
… | …011110011110010000110101 |
3 | 210111212011110200222121221001 |
4 | 211103100310132132100311 |
5 | 133000304333004212100 |
6 | 1340524110221523301 |
7 | 46361216615500531 |
oct | 4523206436362065 |
9 | 714764420877831 |
10 | 164051451241525 |
11 | 482a9914460161 |
12 | 1649632b113531 |
13 | 706cca710c873 |
14 | 2c721bdc28bc1 |
15 | 13e754c2d9d6a |
hex | 95343479e435 |
164051451241525 has 6 divisors (see below), whose sum is σ = 203423799539522. Its totient is φ = 131241160993200.
The previous prime is 164051451241523. The next prime is 164051451241537. The reversal of 164051451241525 is 525142154150461.
It can be written as a sum of positive squares in 3 ways, for example, as 2682752443921 + 161368698797604 = 1637911^2 + 12703098^2 .
It is not a de Polignac number, because 164051451241525 - 21 = 164051451241523 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164051451241523) 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 5 ways as a sum of consecutive naturals, for example, 3281029024806 + ... + 3281029024855.
Almost surely, 2164051451241525 is an apocalyptic number.
It is an amenable number.
164051451241525 is a deficient number, since it is larger than the sum of its proper divisors (39372348297997).
164051451241525 is an equidigital number, since it uses as much as digits as its factorization.
164051451241525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6562058049671 (or 6562058049666 counting only the distinct ones).
The product of its (nonzero) digits is 960000, while the sum is 46.
The spelling of 164051451241525 in words is "one hundred sixty-four trillion, fifty-one billion, four hundred fifty-one million, two hundred forty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •