Base | Representation |
---|---|
bin | 1000011110001001011… |
… | …0000001100110101101 |
3 | 111220122022220100001212 |
4 | 2013202112001212231 |
5 | 4341022011022300 |
6 | 150504533444205 |
7 | 13341255011342 |
oct | 2074226014655 |
9 | 456568810055 |
10 | 145531345325 |
11 | 567a0717813 |
12 | 242561a0665 |
13 | 1095382c0b2 |
14 | 70880c47c9 |
15 | 3bbb633935 |
hex | 21e25819ad |
145531345325 has 6 divisors (see below), whose sum is σ = 180458868234. Its totient is φ = 116425076240.
The previous prime is 145531345303. The next prime is 145531345327. The reversal of 145531345325 is 523543135541.
It can be written as a sum of positive squares in 3 ways, for example, as 38039821444 + 107491523881 = 195038^2 + 327859^2 .
It is not a de Polignac number, because 145531345325 - 226 = 145464236461 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145531345327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2910626882 + ... + 2910626931.
It is an arithmetic number, because the mean of its divisors is an integer number (30076478039).
Almost surely, 2145531345325 is an apocalyptic number.
It is an amenable number.
145531345325 is a deficient number, since it is larger than the sum of its proper divisors (34927522909).
145531345325 is an equidigital number, since it uses as much as digits as its factorization.
145531345325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5821253823 (or 5821253818 counting only the distinct ones).
The product of its digits is 540000, while the sum is 41.
The spelling of 145531345325 in words is "one hundred forty-five billion, five hundred thirty-one million, three hundred forty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •