Base | Representation |
---|---|
bin | 100000101001110101100000… |
… | …010111001010100111110101 |
3 | 200211111012210201221222000211 |
4 | 200221311200113022213311 |
5 | 122310421233132140114 |
6 | 1225234350541505421 |
7 | 42151441045030663 |
oct | 4051654027124765 |
9 | 624435721858024 |
10 | 143612438161909 |
11 | 41839769412672 |
12 | 14135076b72271 |
13 | 6219796a45c02 |
14 | 2766c44341c33 |
15 | 1190a50a1e6c4 |
hex | 829d605ca9f5 |
143612438161909 has 2 divisors, whose sum is σ = 143612438161910. Its totient is φ = 143612438161908.
The previous prime is 143612438161813. The next prime is 143612438161961. The reversal of 143612438161909 is 909161834216341.
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., 140236042936900 + 3376395225009 = 11842130^2 + 1837497^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143612438161909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143612438161999) 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 as a sum of consecutive naturals, namely, 71806219080954 + 71806219080955.
It is an arithmetic number, because the mean of its divisors is an integer number (71806219080955).
Almost surely, 2143612438161909 is an apocalyptic number.
It is an amenable number.
143612438161909 is a deficient number, since it is larger than the sum of its proper divisors (1).
143612438161909 is an equidigital number, since it uses as much as digits as its factorization.
143612438161909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6718464, while the sum is 58.
The spelling of 143612438161909 in words is "one hundred forty-three trillion, six hundred twelve billion, four hundred thirty-eight million, one hundred sixty-one thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •