Base | Representation |
---|---|
bin | 1000011100010000100… |
… | …1001100001101111011 |
3 | 111212100000111021120021 |
4 | 2013010021030031323 |
5 | 4334002303230233 |
6 | 150342353511311 |
7 | 13322563210531 |
oct | 2070411141573 |
9 | 455300437507 |
10 | 145024664443 |
11 | 5656070798a |
12 | 24134572537 |
13 | 108a2878119 |
14 | 703aab0151 |
15 | 3b8bdeae2d |
hex | 21c424c37b |
145024664443 has 4 divisors (see below), whose sum is σ = 145031010120. Its totient is φ = 145018318768.
The previous prime is 145024664437. The next prime is 145024664461. The reversal of 145024664443 is 344466420541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 344466420541 = 81457 ⋅4228813.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145024664443 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 145024664443.
It is not an unprimeable number, because it can be changed into a prime (145024664143) 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 3 ways as a sum of consecutive naturals, for example, 3138433 + ... + 3184306.
It is an arithmetic number, because the mean of its divisors is an integer number (36257752530).
Almost surely, 2145024664443 is an apocalyptic number.
145024664443 is a deficient number, since it is larger than the sum of its proper divisors (6345677).
145024664443 is an equidigital number, since it uses as much as digits as its factorization.
145024664443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6345676.
The product of its (nonzero) digits is 1105920, while the sum is 43.
The spelling of 145024664443 in words is "one hundred forty-five billion, twenty-four million, six hundred sixty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •