Base | Representation |
---|---|
bin | 1000011000111100000… |
… | …0001110010111011101 |
3 | 111210000212220012120022 |
4 | 2012033000032113131 |
5 | 4330141034342001 |
6 | 150114105001525 |
7 | 13261516214135 |
oct | 2061700162735 |
9 | 453025805508 |
10 | 144133121501 |
11 | 56143431536 |
12 | 23b25a832a5 |
13 | 1078cc52c15 |
14 | 6d94515ac5 |
15 | 3b389e011b |
hex | 218f00e5dd |
144133121501 has 8 divisors (see below), whose sum is σ = 144331555704. Its totient is φ = 143934785280.
The previous prime is 144133121491. The next prime is 144133121519. The reversal of 144133121501 is 105121331441.
It can be written as a sum of positive squares in 4 ways, for example, as 2512615876 + 141620505625 = 50126^2 + 376325^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144133121501 - 210 = 144133120477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144133121551) 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, 3208145 + ... + 3252761.
It is an arithmetic number, because the mean of its divisors is an integer number (18041444463).
Almost surely, 2144133121501 is an apocalyptic number.
It is an amenable number.
144133121501 is a deficient number, since it is larger than the sum of its proper divisors (198434203).
144133121501 is an equidigital number, since it uses as much as digits as its factorization.
144133121501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48991.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 144133121501 its reverse (105121331441), we get a palindrome (249254452942).
The spelling of 144133121501 in words is "one hundred forty-four billion, one hundred thirty-three million, one hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •