Base | Representation |
---|---|
bin | 100000101111111111010101… |
… | …110000000111000010110101 |
3 | 200212222122022201021011112010 |
4 | 200233333111300013002311 |
5 | 122334333310443231013 |
6 | 1230200524315514433 |
7 | 42224131236015360 |
oct | 4057772560070265 |
9 | 625878281234463 |
10 | 144035314430133 |
11 | 41992041003965 |
12 | 141a3013458a19 |
13 | 624a619910a29 |
14 | 277d4bc7c50d7 |
15 | 119ba509367c3 |
hex | 82ffd5c070b5 |
144035314430133 has 16 divisors (see below), whose sum is σ = 219510803457536. Its totient is φ = 82295236623600.
The previous prime is 144035314430131. The next prime is 144035314430143. The reversal of 144035314430133 is 331034413530441.
It is not a de Polignac number, because 144035314430133 - 21 = 144035314430131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144035314430091 and 144035314430100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144035314430131) 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, 443889643 + ... + 444214008.
It is an arithmetic number, because the mean of its divisors is an integer number (13719425216096).
Almost surely, 2144035314430133 is an apocalyptic number.
It is an amenable number.
144035314430133 is a deficient number, since it is larger than the sum of its proper divisors (75475489027403).
144035314430133 is an equidigital number, since it uses as much as digits as its factorization.
144035314430133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888111384.
The product of its (nonzero) digits is 311040, while the sum is 39.
Adding to 144035314430133 its reverse (331034413530441), we get a palindrome (475069727960574).
The spelling of 144035314430133 in words is "one hundred forty-four trillion, thirty-five billion, three hundred fourteen million, four hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •