Base | Representation |
---|---|
bin | 1000011001001110101… |
… | …0001001011111001111 |
3 | 111210020022212001011021 |
4 | 2012103222021133033 |
5 | 4330321033023211 |
6 | 150125534535011 |
7 | 13263455101615 |
oct | 2062352113717 |
9 | 453208761137 |
10 | 144211220431 |
11 | 56183524403 |
12 | 23b48067467 |
13 | 107a3198bc5 |
14 | 6da0a456b5 |
15 | 3b407ba771 |
hex | 2193a897cf |
144211220431 has 8 divisors (see below), whose sum is σ = 144549943200. Its totient is φ = 143872576512.
The previous prime is 144211220393. The next prime is 144211220437. The reversal of 144211220431 is 134022112441.
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 144211220431 - 213 = 144211212239 is a prime.
It is a super-2 number, since 2×1442112204312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144211220396 and 144211220405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144211220437) 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, 5299446 + ... + 5326588.
It is an arithmetic number, because the mean of its divisors is an integer number (18068742900).
Almost surely, 2144211220431 is an apocalyptic number.
144211220431 is a deficient number, since it is larger than the sum of its proper divisors (338722769).
144211220431 is a wasteful number, since it uses less digits than its factorization.
144211220431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39425.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 144211220431 its reverse (134022112441), we get a palindrome (278233332872).
The spelling of 144211220431 in words is "one hundred forty-four billion, two hundred eleven million, two hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •