Base | Representation |
---|---|
bin | 1000011011001011111… |
… | …1010111011011011001 |
3 | 111211120221222010101021 |
4 | 2012302333113123121 |
5 | 4332410120014444 |
6 | 150254033322441 |
7 | 13312500102100 |
oct | 2066277273331 |
9 | 454527863337 |
10 | 144736876249 |
11 | 564232143a9 |
12 | 24074106421 |
13 | 10858064854 |
14 | 7010799037 |
15 | 3b71a00584 |
hex | 21b2fd76d9 |
144736876249 has 81 divisors (see below), whose sum is σ = 188323065567. Its totient is φ = 110882395008.
The previous prime is 144736876247. The next prime is 144736876313. The reversal of 144736876249 is 942678637441.
The square root of 144736876249 is 380443.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 112684419225 + 32052457024 = 335685^2 + 179032^2 .
It is not a de Polignac number, because 144736876249 - 21 = 144736876247 is a prime.
It is not an unprimeable number, because it can be changed into a prime (144736876247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 1041272422 + ... + 1041272560.
Almost surely, 2144736876249 is an apocalyptic number.
144736876249 is the 380443-rd square number.
144736876249 is the 190222-nd centered octagonal number.
It is an amenable number.
144736876249 is a deficient number, since it is larger than the sum of its proper divisors (43586189318).
144736876249 is an equidigital number, since it uses as much as digits as its factorization.
144736876249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372 (or 186 counting only the distinct ones).
The product of its digits is 48771072, while the sum is 61.
The spelling of 144736876249 in words is "one hundred forty-four billion, seven hundred thirty-six million, eight hundred seventy-six thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •