Base | Representation |
---|---|
bin | 1000011100010010111… |
… | …0011100110010011101 |
3 | 111212100200212111122111 |
4 | 2013010232130302131 |
5 | 4334012303303040 |
6 | 150343343114021 |
7 | 13323042220405 |
oct | 2070456346235 |
9 | 455320774574 |
10 | 145034431645 |
11 | 56566179154 |
12 | 241378a2911 |
13 | 108a48b7a2c |
14 | 703c0d3805 |
15 | 3b8cbc9dea |
hex | 21c4b9cc9d |
145034431645 has 8 divisors (see below), whose sum is σ = 174059195904. Its totient is φ = 116015626704.
The previous prime is 145034431639. The next prime is 145034431667. The reversal of 145034431645 is 546134430541.
145034431645 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145034431645 - 215 = 145034398877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145034431598 and 145034431607.
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 7 ways as a sum of consecutive naturals, for example, 1436109 + ... + 1533778.
It is an arithmetic number, because the mean of its divisors is an integer number (21757399488).
Almost surely, 2145034431645 is an apocalyptic number.
It is an amenable number.
145034431645 is a deficient number, since it is larger than the sum of its proper divisors (29024764259).
145034431645 is an equidigital number, since it uses as much as digits as its factorization.
145034431645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2979659.
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 145034431645 in words is "one hundred forty-five billion, thirty-four million, four hundred thirty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •