Base | Representation |
---|---|
bin | 100000111111111011110010… |
… | …011010110011000101100111 |
3 | 201000212101111202122000210101 |
4 | 200333323302122303011213 |
5 | 123010311303040334421 |
6 | 1232400133322204531 |
7 | 42366240526035463 |
oct | 4077736232630547 |
9 | 630771452560711 |
10 | 145131012043111 |
11 | 422747978168a6 |
12 | 1433b442353747 |
13 | 62c9a46242163 |
14 | 27ba5427034a3 |
15 | 11ba2cd831191 |
hex | 83fef26b3167 |
145131012043111 has 16 divisors (see below), whose sum is σ = 150242535072000. Its totient is φ = 140026635202048.
The previous prime is 145131012043081. The next prime is 145131012043207. The reversal of 145131012043111 is 111340210131541.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 145131012043111 - 215 = 145131012010343 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 145131012043111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145131012043411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 704590965 + ... + 704796913.
It is an arithmetic number, because the mean of its divisors is an integer number (9390158442000).
Almost surely, 2145131012043111 is an apocalyptic number.
145131012043111 is a deficient number, since it is larger than the sum of its proper divisors (5111523028889).
145131012043111 is a wasteful number, since it uses less digits than its factorization.
145131012043111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223178.
The product of its (nonzero) digits is 1440, while the sum is 28.
Adding to 145131012043111 its reverse (111340210131541), we get a palindrome (256471222174652).
The spelling of 145131012043111 in words is "one hundred forty-five trillion, one hundred thirty-one billion, twelve million, forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •