Base | Representation |
---|---|
bin | 100000110001101011111101… |
… | …100111100101001000011101 |
3 | 200220101210101001202220121001 |
4 | 200301223331213211020131 |
5 | 122343241142013242314 |
6 | 1230330253533110301 |
7 | 42235430431630504 |
oct | 4061537547451035 |
9 | 626353331686531 |
10 | 144151947399709 |
11 | 41a27552301207 |
12 | 14201743628391 |
13 | 6258616376ab2 |
14 | 2784dc48a383b |
15 | 119eac9ee8674 |
hex | 831afd9e521d |
144151947399709 has 2 divisors, whose sum is σ = 144151947399710. Its totient is φ = 144151947399708.
The previous prime is 144151947399697. The next prime is 144151947399773. The reversal of 144151947399709 is 907993749151441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139649288328900 + 4502659070809 = 11817330^2 + 2121947^2 .
It is a cyclic number.
It is not a de Polignac number, because 144151947399709 - 29 = 144151947399197 is a prime.
It is a super-2 number, since 2×1441519473997092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144151947309709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72075973699854 + 72075973699855.
It is an arithmetic number, because the mean of its divisors is an integer number (72075973699855).
Almost surely, 2144151947399709 is an apocalyptic number.
It is an amenable number.
144151947399709 is a deficient number, since it is larger than the sum of its proper divisors (1).
144151947399709 is an equidigital number, since it uses as much as digits as its factorization.
144151947399709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 308629440, while the sum is 73.
The spelling of 144151947399709 in words is "one hundred forty-four trillion, one hundred fifty-one billion, nine hundred forty-seven million, three hundred ninety-nine thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •