Base | Representation |
---|---|
bin | 100000110000011010010001… |
… | …100000111001000111011001 |
3 | 200220002101222012012220000001 |
4 | 200300122101200321013121 |
5 | 122340322022444030210 |
6 | 1230222110130213001 |
7 | 42226204012252456 |
oct | 4060322140710731 |
9 | 626071865186001 |
10 | 144064234361305 |
11 | 419a3331606225 |
12 | 141a8744724161 |
13 | 62502782b313b |
14 | 2780a635dc82d |
15 | 119c69481503a |
hex | 8306918391d9 |
144064234361305 has 8 divisors (see below), whose sum is σ = 180393476069952. Its totient is φ = 110240457598128.
The previous prime is 144064234361287. The next prime is 144064234361387. The reversal of 144064234361305 is 503163432460441.
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 144064234361305 - 213 = 144064234353113 is a prime.
It is a super-2 number, since 2×1440642343613052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 626366236239 + ... + 626366236468.
It is an arithmetic number, because the mean of its divisors is an integer number (22549184508744).
Almost surely, 2144064234361305 is an apocalyptic number.
It is an amenable number.
144064234361305 is a deficient number, since it is larger than the sum of its proper divisors (36329241708647).
144064234361305 is a wasteful number, since it uses less digits than its factorization.
144064234361305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252732472735.
The product of its (nonzero) digits is 2488320, while the sum is 46.
The spelling of 144064234361305 in words is "one hundred forty-four trillion, sixty-four billion, two hundred thirty-four million, three hundred sixty-one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •