Base | Representation |
---|---|
bin | 10001001010111… |
… | …10000100011001 |
3 | 101001001000000212 |
4 | 20211132010121 |
5 | 243333241332 |
6 | 22143140505 |
7 | 3366215216 |
oct | 1045360431 |
9 | 331030025 |
10 | 144040217 |
11 | 74341602 |
12 | 402a4735 |
13 | 23ac32c9 |
14 | 151b6b0d |
15 | c9a38b2 |
hex | 895e119 |
144040217 has 2 divisors, whose sum is σ = 144040218. Its totient is φ = 144040216.
The previous prime is 144040189. The next prime is 144040219. The reversal of 144040217 is 712040441.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97199881 + 46840336 = 9859^2 + 6844^2 .
It is a cyclic number.
It is not a de Polignac number, because 144040217 - 224 = 127263001 is a prime.
It is a super-2 number, since 2×1440402172 = 41495168226814178, which contains 22 as substring.
Together with 144040219, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 144040192 and 144040201.
It is not a weakly prime, because it can be changed into another prime (144040219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72020108 + 72020109.
It is an arithmetic number, because the mean of its divisors is an integer number (72020109).
Almost surely, 2144040217 is an apocalyptic number.
It is an amenable number.
144040217 is a deficient number, since it is larger than the sum of its proper divisors (1).
144040217 is an equidigital number, since it uses as much as digits as its factorization.
144040217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 896, while the sum is 23.
The square root of 144040217 is about 12001.6755913497. The cubic root of 144040217 is about 524.1970698354.
Adding to 144040217 its reverse (712040441), we get a palindrome (856080658).
The spelling of 144040217 in words is "one hundred forty-four million, forty thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •