Base | Representation |
---|---|
bin | 1110001101011101001… |
… | …0100110000011110111 |
3 | 212100010211221022010211 |
4 | 3203113102212003313 |
5 | 12444434304111003 |
6 | 304052444130251 |
7 | 23431525663300 |
oct | 3432722460367 |
9 | 770124838124 |
10 | 244130144503 |
11 | 94598113a03 |
12 | 3b392836987 |
13 | 1a037c5c60b |
14 | bb5cddd7a7 |
15 | 653c83c96d |
hex | 38d74a60f7 |
244130144503 has 24 divisors (see below), whose sum is σ = 290654838672. Its totient is φ = 204344187264.
The previous prime is 244130144497. The next prime is 244130144509. The reversal of 244130144503 is 305441031442.
It is an interprime number because it is at equal distance from previous prime (244130144497) and next prime (244130144509).
It is not a de Polignac number, because 244130144503 - 229 = 243593273591 is a prime.
It is a super-2 number, since 2×2441301445032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (244130144509) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13089901 + ... + 13108537.
It is an arithmetic number, because the mean of its divisors is an integer number (12110618278).
Almost surely, 2244130144503 is an apocalyptic number.
244130144503 is a deficient number, since it is larger than the sum of its proper divisors (46524694169).
244130144503 is a wasteful number, since it uses less digits than its factorization.
244130144503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24911 (or 24904 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 244130144503 its reverse (305441031442), we get a palindrome (549571175945).
The spelling of 244130144503 in words is "two hundred forty-four billion, one hundred thirty million, one hundred forty-four thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •