Base | Representation |
---|---|
bin | 100000110010111111110101… |
… | …111001101100000001010011 |
3 | 200220201101211211122221121211 |
4 | 200302333311321230001103 |
5 | 122401230120113221003 |
6 | 1230435510551200551 |
7 | 42245066346306604 |
oct | 4062776571540123 |
9 | 626641754587554 |
10 | 144242012242003 |
11 | 41a6176a590275 |
12 | 1421709a076157 |
13 | 6263c6a7500a0 |
14 | 27894ca23ddab |
15 | 11a20ebdd296d |
hex | 832ff5e6c053 |
144242012242003 has 8 divisors (see below), whose sum is σ = 155760814733888. Its totient is φ = 132783675905664.
The previous prime is 144242012241931. The next prime is 144242012242021. The reversal of 144242012242003 is 300242210242441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144242012242003 - 29 = 144242012241491 is a prime.
It is not an unprimeable number, because it can be changed into a prime (144242012242033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15116533926 + ... + 15116543467.
It is an arithmetic number, because the mean of its divisors is an integer number (19470101841736).
Almost surely, 2144242012242003 is an apocalyptic number.
144242012242003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
144242012242003 is a deficient number, since it is larger than the sum of its proper divisors (11518802491885).
144242012242003 is a wasteful number, since it uses less digits than its factorization.
144242012242003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30233077773.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 144242012242003 its reverse (300242210242441), we get a palindrome (444484222484444).
The spelling of 144242012242003 in words is "one hundred forty-four trillion, two hundred forty-two billion, twelve million, two hundred forty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •