Base | Representation |
---|---|
bin | 10001001110011… |
… | …11100010000001 |
3 | 101001220121112121 |
4 | 20213033202001 |
5 | 243443124321 |
6 | 22201124241 |
7 | 3403162156 |
oct | 1047174201 |
9 | 331817477 |
10 | 144504961 |
11 | 74629797 |
12 | 40489681 |
13 | 23c269c3 |
14 | 1529822d |
15 | ca46441 |
hex | 89cf881 |
144504961 has 4 divisors (see below), whose sum is σ = 144568132. Its totient is φ = 144441792.
The previous prime is 144504959. The next prime is 144504979. The reversal of 144504961 is 169405441.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 169405441 = 4919 ⋅34439.
It can be written as a sum of positive squares in 2 ways, for example, as 81000000 + 63504961 = 9000^2 + 7969^2 .
It is a cyclic number.
It is not a de Polignac number, because 144504961 - 21 = 144504959 is a prime.
It is a super-2 number, since 2×1445049612 = 41763367507223042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144504991) 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, 28020 + ... + 32773.
It is an arithmetic number, because the mean of its divisors is an integer number (36142033).
Almost surely, 2144504961 is an apocalyptic number.
It is an amenable number.
144504961 is a deficient number, since it is larger than the sum of its proper divisors (63171).
144504961 is an equidigital number, since it uses as much as digits as its factorization.
144504961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63170.
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 144504961 is about 12021.0216287968. The cubic root of 144504961 is about 524.7602363990.
The spelling of 144504961 in words is "one hundred forty-four million, five hundred four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •