Base | Representation |
---|---|
bin | 10001010000010… |
… | …10001000000001 |
3 | 101002100210202111 |
4 | 20220022020001 |
5 | 244023314321 |
6 | 22210215321 |
7 | 3405211654 |
oct | 1050121001 |
9 | 332323674 |
10 | 144744961 |
11 | 74783039 |
12 | 40584541 |
13 | 23cac00a |
14 | 1531b89b |
15 | ca925e1 |
hex | 8a0a201 |
144744961 has 9 divisors (see below), whose sum is σ = 148180291. Its totient is φ = 141388312.
The previous prime is 144744947. The next prime is 144744967. The reversal of 144744961 is 169447441.
The square root of 144744961 is 12031.
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., 104346225 + 40398736 = 10215^2 + 6356^2 .
It is not a de Polignac number, because 144744961 - 27 = 144744833 is a prime.
It is a super-2 number, since 2×1447449612 = 41902207469783042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144744967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 637530 + ... + 637756.
Almost surely, 2144744961 is an apocalyptic number.
144744961 is the 12031-st square number.
144744961 is the 6016-th centered octagonal number.
It is an amenable number.
144744961 is a deficient number, since it is larger than the sum of its proper divisors (3435330).
144744961 is an frugal number, since it uses more digits than its factorization.
144744961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560 (or 280 counting only the distinct ones).
The product of its digits is 96768, while the sum is 40.
The cubic root of 144744961 is about 525.0505904385.
The spelling of 144744961 in words is "one hundred forty-four million, seven hundred forty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •