Base | Representation |
---|---|
bin | 1000011010000101000… |
… | …0011100100111110001 |
3 | 111210211020010221102002 |
4 | 2012201100130213301 |
5 | 4331302434122311 |
6 | 150204324503345 |
7 | 13302225223505 |
oct | 2064120344761 |
9 | 453736127362 |
10 | 144439364081 |
11 | 5629028a081 |
12 | 23bb054ab55 |
13 | 1080b52824c |
14 | 6dc3072305 |
15 | 3b5583393b |
hex | 21a141c9f1 |
144439364081 has 4 divisors (see below), whose sum is σ = 144442056192. Its totient is φ = 144436671972.
The previous prime is 144439364057. The next prime is 144439364107. The reversal of 144439364081 is 180463934441.
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: 180463934441 = 7 ⋅25780562063.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144439364081 is a prime.
It is a super-2 number, since 2×1444393640812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (144439364021) 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, 1263905 + ... + 1373438.
It is an arithmetic number, because the mean of its divisors is an integer number (36110514048).
Almost surely, 2144439364081 is an apocalyptic number.
It is an amenable number.
144439364081 is a deficient number, since it is larger than the sum of its proper divisors (2692111).
144439364081 is an equidigital number, since it uses as much as digits as its factorization.
144439364081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2692110.
The product of its (nonzero) digits is 995328, while the sum is 47.
The spelling of 144439364081 in words is "one hundred forty-four billion, four hundred thirty-nine million, three hundred sixty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •