Base | Representation |
---|---|
bin | 1000011010110111100… |
… | …0100101000101111101 |
3 | 111211100222202212221012 |
4 | 2012231320211011331 |
5 | 4332221202224013 |
6 | 150241333245005 |
7 | 13310410002422 |
oct | 2065570450575 |
9 | 454328685835 |
10 | 144651211133 |
11 | 56389923990 |
12 | 2404b493765 |
13 | 1084339ca30 |
14 | 7003259d49 |
15 | 3b6922d1a8 |
hex | 21ade2517d |
144651211133 has 16 divisors (see below), whose sum is σ = 170294745600. Its totient is φ = 121132159680.
The previous prime is 144651211097. The next prime is 144651211151. The reversal of 144651211133 is 331112156441.
It is a cyclic number.
It is not a de Polignac number, because 144651211133 - 28 = 144651210877 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 144651211133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144651211163) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 987398 + ... + 1124391.
It is an arithmetic number, because the mean of its divisors is an integer number (10643421600).
Almost surely, 2144651211133 is an apocalyptic number.
144651211133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
144651211133 is a deficient number, since it is larger than the sum of its proper divisors (25643534467).
144651211133 is a wasteful number, since it uses less digits than its factorization.
144651211133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2112292.
The product of its digits is 8640, while the sum is 32.
Adding to 144651211133 its reverse (331112156441), we get a palindrome (475763367574).
The spelling of 144651211133 in words is "one hundred forty-four billion, six hundred fifty-one million, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •