Base | Representation |
---|---|
bin | 1000011010111010100… |
… | …0011111001111000101 |
3 | 111211101212101221112101 |
4 | 2012232220133033011 |
5 | 4332232411120203 |
6 | 150242502352101 |
7 | 13310621520355 |
oct | 2065650371705 |
9 | 454355357471 |
10 | 144663770053 |
11 | 56395a21660 |
12 | 2405372b631 |
13 | 10845b7924a |
14 | 7004ba8b65 |
15 | 3b6a3ae41d |
hex | 21aea1f3c5 |
144663770053 has 4 divisors (see below), whose sum is σ = 157815021888. Its totient is φ = 131512518220.
The previous prime is 144663770039. The next prime is 144663770071. The reversal of 144663770053 is 350077366441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350077366441 = 11 ⋅31825215131.
It is a cyclic number.
It is not a de Polignac number, because 144663770053 - 217 = 144663638981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144663769985 and 144663770012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144663770023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6575625901 + ... + 6575625922.
It is an arithmetic number, because the mean of its divisors is an integer number (39453755472).
Almost surely, 2144663770053 is an apocalyptic number.
It is an amenable number.
144663770053 is a deficient number, since it is larger than the sum of its proper divisors (13151251835).
144663770053 is a wasteful number, since it uses less digits than its factorization.
144663770053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13151251834.
The product of its (nonzero) digits is 1270080, while the sum is 46.
The spelling of 144663770053 in words is "one hundred forty-four billion, six hundred sixty-three million, seven hundred seventy thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •