Base | Representation |
---|---|
bin | 100000110000000100010010… |
… | …100111110010010010100101 |
3 | 200220000011001012121212111210 |
4 | 200300010102213302102211 |
5 | 122334430202420003240 |
6 | 1230203204024222033 |
7 | 42224410050644151 |
oct | 4060042247622245 |
9 | 626004035555453 |
10 | 144040630625445 |
11 | 41994319947104 |
12 | 141a405790a919 |
13 | 624ac8611ab28 |
14 | 277d864874061 |
15 | 119bc624ea780 |
hex | 8301129f24a5 |
144040630625445 has 16 divisors (see below), whose sum is σ = 244021774236480. Its totient is φ = 72302747921664.
The previous prime is 144040630625431. The next prime is 144040630625477. The reversal of 144040630625445 is 544526036040441.
It is not a de Polignac number, because 144040630625445 - 235 = 144006270887077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144040630625394 and 144040630625403.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282432608815 + ... + 282432609324.
It is an arithmetic number, because the mean of its divisors is an integer number (15251360889780).
Almost surely, 2144040630625445 is an apocalyptic number.
144040630625445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
144040630625445 is a deficient number, since it is larger than the sum of its proper divisors (99981143611035).
144040630625445 is a wasteful number, since it uses less digits than its factorization.
144040630625445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 564865218164.
The product of its (nonzero) digits is 5529600, while the sum is 48.
Adding to 144040630625445 its reverse (544526036040441), we get a palindrome (688566666665886).
The spelling of 144040630625445 in words is "one hundred forty-four trillion, forty billion, six hundred thirty million, six hundred twenty-five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •