Base | Representation |
---|---|
bin | 1000011001000000100… |
… | …0010111001100110101 |
3 | 111210002012110221222010 |
4 | 2012100020113030311 |
5 | 4330210410011203 |
6 | 150120022154433 |
7 | 13262136025011 |
oct | 2062010271465 |
9 | 453065427863 |
10 | 144152032053 |
11 | 56153078297 |
12 | 23b30282a19 |
13 | 10793b444b3 |
14 | 6d96c39541 |
15 | 3b3a4c8303 |
hex | 2190217335 |
144152032053 has 4 divisors (see below), whose sum is σ = 192202709408. Its totient is φ = 96101354700.
The previous prime is 144152032043. The next prime is 144152032067. The reversal of 144152032053 is 350230251441.
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 de Polignac number, because none of the positive numbers 2k-144152032053 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 144152032053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144152032043) 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, 24025338673 + ... + 24025338678.
It is an arithmetic number, because the mean of its divisors is an integer number (48050677352).
Almost surely, 2144152032053 is an apocalyptic number.
It is an amenable number.
144152032053 is a deficient number, since it is larger than the sum of its proper divisors (48050677355).
144152032053 is an equidigital number, since it uses as much as digits as its factorization.
144152032053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48050677354.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 144152032053 its reverse (350230251441), we get a palindrome (494382283494).
The spelling of 144152032053 in words is "one hundred forty-four billion, one hundred fifty-two million, thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •