Base | Representation |
---|---|
bin | 100000111101000111010111… |
… | …011000001001011101111111 |
3 | 201000011212110120201012100212 |
4 | 200331013113120021131333 |
5 | 122444123024404211244 |
6 | 1232131134111543035 |
7 | 42346242013660163 |
oct | 4075072730113577 |
9 | 630155416635325 |
10 | 144937284835199 |
11 | 421aa61486719a |
12 | 1430999752aa7b |
13 | 62b46b168169c |
14 | 27b1005760ca3 |
15 | 11b5240e2bd9e |
hex | 83d1d760977f |
144937284835199 has 4 divisors (see below), whose sum is σ = 152565562984440. Its totient is φ = 137309006685960.
The previous prime is 144937284835129. The next prime is 144937284835271. The reversal of 144937284835199 is 991538482739441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144937284835199 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144937284835129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3814139074592 + ... + 3814139074629.
It is an arithmetic number, because the mean of its divisors is an integer number (38141390746110).
Almost surely, 2144937284835199 is an apocalyptic number.
144937284835199 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
144937284835199 is a deficient number, since it is larger than the sum of its proper divisors (7628278149241).
144937284835199 is an equidigital number, since it uses as much as digits as its factorization.
144937284835199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7628278149240.
The product of its digits is 1881169920, while the sum is 77.
The spelling of 144937284835199 in words is "one hundred forty-four trillion, nine hundred thirty-seven billion, two hundred eighty-four million, eight hundred thirty-five thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •