Base | Representation |
---|---|
bin | 100000111110100010011010… |
… | …010011010011001111011111 |
3 | 201000112012210121120202020111 |
4 | 200332202122103103033133 |
5 | 123002223232331332033 |
6 | 1232244102442430451 |
7 | 42356302414405660 |
oct | 4076423223231737 |
9 | 630465717522214 |
10 | 145035044402143 |
11 | 42238020566825 |
12 | 1432491ab02427 |
13 | 62c0990c73a9c |
14 | 27b5a3b01b367 |
15 | 11b7a6360e7cd |
hex | 83e89a4d33df |
145035044402143 has 8 divisors (see below), whose sum is σ = 165780997975712. Its totient is φ = 124295756207616.
The previous prime is 145035044402041. The next prime is 145035044402189. The reversal of 145035044402143 is 341204440530541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-145035044402143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145035044402096 and 145035044402105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145035044400143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1666298130 + ... + 1666385167.
It is an arithmetic number, because the mean of its divisors is an integer number (20722624746964).
Almost surely, 2145035044402143 is an apocalyptic number.
145035044402143 is a deficient number, since it is larger than the sum of its proper divisors (20745953573569).
145035044402143 is an equidigital number, since it uses as much as digits as its factorization.
145035044402143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3332689521.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 145035044402143 its reverse (341204440530541), we get a palindrome (486239484932684).
The spelling of 145035044402143 in words is "one hundred forty-five trillion, thirty-five billion, forty-four million, four hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •