Base | Representation |
---|---|
bin | 1000011001100110101… |
… | …1010111101011111111 |
3 | 111210111100212112121121 |
4 | 2012121223113223333 |
5 | 4331022411012111 |
6 | 150143543211411 |
7 | 13266122331502 |
oct | 2063153275377 |
9 | 453440775547 |
10 | 144312204031 |
11 | 56225527926 |
12 | 23b75a46b67 |
13 | 107bb095308 |
14 | 6db0211139 |
15 | 3b495b6871 |
hex | 2199ad7aff |
144312204031 has 8 divisors (see below), whose sum is σ = 146473185920. Its totient is φ = 142151430168.
The previous prime is 144312203957. The next prime is 144312204089. The reversal of 144312204031 is 130402213441.
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 144312204031 - 233 = 135722269439 is a prime.
It is a super-2 number, since 2×1443122040312 (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 = 144312203987 and 144312204005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144312204131) 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, 1877110 + ... + 1952476.
It is an arithmetic number, because the mean of its divisors is an integer number (18309148240).
Almost surely, 2144312204031 is an apocalyptic number.
144312204031 is a deficient number, since it is larger than the sum of its proper divisors (2160981889).
144312204031 is an equidigital number, since it uses as much as digits as its factorization.
144312204031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104013.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 144312204031 its reverse (130402213441), we get a palindrome (274714417472).
The spelling of 144312204031 in words is "one hundred forty-four billion, three hundred twelve million, two hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •