Base | Representation |
---|---|
bin | 100000110000110110010011… |
… | …110100000001010011000101 |
3 | 200220012021200010221222212112 |
4 | 200300312103310001103011 |
5 | 122341320200422413221 |
6 | 1230244005213230405 |
7 | 42231321005363426 |
oct | 4060662364012305 |
9 | 626167603858775 |
10 | 144094337701061 |
11 | 41a0507a111a10 |
12 | 141b2546192405 |
13 | 6253064bbac07 |
14 | 27822bb66764d |
15 | 119d35755315b |
hex | 830d93d014c5 |
144094337701061 has 16 divisors (see below), whose sum is σ = 164271822916608. Its totient is φ = 125226152847600.
The previous prime is 144094337701031. The next prime is 144094337701103. The reversal of 144094337701061 is 160107733490441.
It is not a de Polignac number, because 144094337701061 - 210 = 144094337700037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144094337701031) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3240820235 + ... + 3240864696.
It is an arithmetic number, because the mean of its divisors is an integer number (10266988932288).
Almost surely, 2144094337701061 is an apocalyptic number.
144094337701061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144094337701061 is a deficient number, since it is larger than the sum of its proper divisors (20177485215547).
144094337701061 is a wasteful number, since it uses less digits than its factorization.
144094337701061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6481685032.
The product of its (nonzero) digits is 1524096, while the sum is 50.
The spelling of 144094337701061 in words is "one hundred forty-four trillion, ninety-four billion, three hundred thirty-seven million, seven hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •