Base | Representation |
---|---|
bin | 100000101111100000011011… |
… | …110111110010111010110011 |
3 | 200212212110200002222221001201 |
4 | 200233200123313302322303 |
5 | 122333312331031032403 |
6 | 1230133355450112031 |
7 | 42221545023324442 |
oct | 4057403367627263 |
9 | 625773602887051 |
10 | 144002131111603 |
11 | 41979a62980576 |
12 | 141986b241b617 |
13 | 624745bb9abcb |
14 | 277ba51694d59 |
15 | 119ac5c60721d |
hex | 82f81bdf2eb3 |
144002131111603 has 4 divisors (see below), whose sum is σ = 147514378211928. Its totient is φ = 140489884011280.
The previous prime is 144002131111577. The next prime is 144002131111607. The reversal of 144002131111603 is 306111131200441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 144002131111603 - 217 = 144002130980531 is a prime.
It is a super-2 number, since 2×1440021311116032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144002131111607) 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, 1756123550101 + ... + 1756123550182.
It is an arithmetic number, because the mean of its divisors is an integer number (36878594552982).
Almost surely, 2144002131111603 is an apocalyptic number.
144002131111603 is a deficient number, since it is larger than the sum of its proper divisors (3512247100325).
144002131111603 is an equidigital number, since it uses as much as digits as its factorization.
144002131111603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3512247100324.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 144002131111603 in words is "one hundred forty-four trillion, two billion, one hundred thirty-one million, one hundred eleven thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •