Base | Representation |
---|---|
bin | 100000111110011111100101… |
… | …011100000100001010001101 |
3 | 201000111220222010212100100201 |
4 | 200332133211130010022031 |
5 | 123002201024031223230 |
6 | 1232242441405253501 |
7 | 42356134260540130 |
oct | 4076374534041215 |
9 | 630456863770321 |
10 | 145032010023565 |
11 | 42236803755235 |
12 | 14324212864291 |
13 | 62c05c94135c2 |
14 | 27b5830026217 |
15 | 11b79370295ca |
hex | 83e7e570428d |
145032010023565 has 8 divisors (see below), whose sum is σ = 198901042318080. Its totient is φ = 99450521158992.
The previous prime is 145032010023547. The next prime is 145032010023581. The reversal of 145032010023565 is 565320010230541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145032010023565 is a prime.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 2071885857445 + ... + 2071885857514.
It is an arithmetic number, because the mean of its divisors is an integer number (24862630289760).
Almost surely, 2145032010023565 is an apocalyptic number.
It is an amenable number.
145032010023565 is a deficient number, since it is larger than the sum of its proper divisors (53869032294515).
145032010023565 is an equidigital number, since it uses as much as digits as its factorization.
145032010023565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4143771714971.
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 145032010023565 in words is "one hundred forty-five trillion, thirty-two billion, ten million, twenty-three thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •