Base | Representation |
---|---|
bin | 1000011010011000100… |
… | …1110101010010000001 |
3 | 111211000221201200212201 |
4 | 2012212021311102001 |
5 | 4331440002004121 |
6 | 150220421353201 |
7 | 13304243422111 |
oct | 2064611652201 |
9 | 454027650781 |
10 | 144521516161 |
11 | 563226a0160 |
12 | 24013b68801 |
13 | 10822560049 |
14 | 6dcdd39041 |
15 | 3b5cb5ee91 |
hex | 21a6275481 |
144521516161 has 4 divisors (see below), whose sum is σ = 157659835824. Its totient is φ = 131383196500.
The previous prime is 144521516159. The next prime is 144521516207. The reversal of 144521516161 is 161615125441.
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.
It is a cyclic number.
It is not a de Polignac number, because 144521516161 - 21 = 144521516159 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 144521516161.
It is not an unprimeable number, because it can be changed into a prime (144521516141) 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, 6569159815 + ... + 6569159836.
It is an arithmetic number, because the mean of its divisors is an integer number (39414958956).
Almost surely, 2144521516161 is an apocalyptic number.
144521516161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144521516161 is a deficient number, since it is larger than the sum of its proper divisors (13138319663).
144521516161 is a wasteful number, since it uses less digits than its factorization.
144521516161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13138319662.
The product of its digits is 28800, while the sum is 37.
The spelling of 144521516161 in words is "one hundred forty-four billion, five hundred twenty-one million, five hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •