Base | Representation |
---|---|
bin | 10001001010011… |
… | …00100101111101 |
3 | 101000220100211202 |
4 | 20211030211331 |
5 | 243323444022 |
6 | 22141425245 |
7 | 3365466431 |
oct | 1045144575 |
9 | 330810752 |
10 | 143968637 |
11 | 742a284a |
12 | 4026b225 |
13 | 23a99857 |
14 | 151989c1 |
15 | c98c592 |
hex | 894c97d |
143968637 has 2 divisors, whose sum is σ = 143968638. Its totient is φ = 143968636.
The previous prime is 143968633. The next prime is 143968639. The reversal of 143968637 is 736869341.
It is a happy number.
143968637 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122633476 + 21335161 = 11074^2 + 4619^2 .
It is a cyclic number.
It is not a de Polignac number, because 143968637 - 22 = 143968633 is a prime.
Together with 143968639, 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 = 143968591 and 143968600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143968633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71984318 + 71984319.
It is an arithmetic number, because the mean of its divisors is an integer number (71984319).
Almost surely, 2143968637 is an apocalyptic number.
It is an amenable number.
143968637 is a deficient number, since it is larger than the sum of its proper divisors (1).
143968637 is an equidigital number, since it uses as much as digits as its factorization.
143968637 is an evil number, because the sum of its binary digits is even.
The product of its digits is 653184, while the sum is 47.
The square root of 143968637 is about 11998.6931371712. The cubic root of 143968637 is about 524.1102231564.
The spelling of 143968637 in words is "one hundred forty-three million, nine hundred sixty-eight thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •