Base | Representation |
---|---|
bin | 100000110101111001010111… |
… | …110011010001011011101101 |
3 | 200221102110001012021022112222 |
4 | 200311321113303101123231 |
5 | 122413011111121114041 |
6 | 1231111214254005125 |
7 | 42265351106563664 |
oct | 4065712763213355 |
9 | 627373035238488 |
10 | 144441223223021 |
11 | 420291a6a3086a |
12 | 142498154a67a5 |
13 | 627999746260a |
14 | 2794dc7613ddb |
15 | 11a73aae4d74b |
hex | 835e57cd16ed |
144441223223021 has 8 divisors (see below), whose sum is σ = 145580976967680. Its totient is φ = 143301507311088.
The previous prime is 144441223222969. The next prime is 144441223223047. The reversal of 144441223223021 is 120322322144441.
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 144441223223021 - 26 = 144441223222957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144441223223071) 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, 1767701 + ... + 17088218.
It is an arithmetic number, because the mean of its divisors is an integer number (18197622120960).
Almost surely, 2144441223223021 is an apocalyptic number.
It is an amenable number.
144441223223021 is a deficient number, since it is larger than the sum of its proper divisors (1139753744659).
144441223223021 is a wasteful number, since it uses less digits than its factorization.
144441223223021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18916363.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 144441223223021 its reverse (120322322144441), we get a palindrome (264763545367462).
The spelling of 144441223223021 in words is "one hundred forty-four trillion, four hundred forty-one billion, two hundred twenty-three million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •