Base | Representation |
---|---|
bin | 1000011100010111011… |
… | …0000111110100101111 |
3 | 111212102000020001121210 |
4 | 2013011312013310233 |
5 | 4334032111021033 |
6 | 150345253525503 |
7 | 13323361012356 |
oct | 2070566076457 |
9 | 455360201553 |
10 | 145053220143 |
11 | 56575841237 |
12 | 24142043893 |
13 | 108a87658a0 |
14 | 70407c499d |
15 | 3b8e68bd63 |
hex | 21c5d87d2f |
145053220143 has 32 divisors (see below), whose sum is σ = 213196161024. Its totient is φ = 87158639232.
The previous prime is 145053220141. The next prime is 145053220163. The reversal of 145053220143 is 341022350541.
It is not a de Polignac number, because 145053220143 - 21 = 145053220141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145053220143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145053220141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5710930 + ... + 5736272.
It is an arithmetic number, because the mean of its divisors is an integer number (6662380032).
Almost surely, 2145053220143 is an apocalyptic number.
145053220143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
145053220143 is a deficient number, since it is larger than the sum of its proper divisors (68142940881).
145053220143 is a wasteful number, since it uses less digits than its factorization.
145053220143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28815.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 145053220143 its reverse (341022350541), we get a palindrome (486075570684).
The spelling of 145053220143 in words is "one hundred forty-five billion, fifty-three million, two hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •