Base | Representation |
---|---|
bin | 1000010101000111000… |
… | …0011001010110001111 |
3 | 111200101021100202220222 |
4 | 2011101300121112033 |
5 | 4321040010440444 |
6 | 145424120501555 |
7 | 13224201130631 |
oct | 2052160312617 |
9 | 450337322828 |
10 | 143105561999 |
11 | 557663a4904 |
12 | 2389991a8bb |
13 | 106580b684a |
14 | 6cd7c72a51 |
15 | 3ac86b7eee |
hex | 2151c1958f |
143105561999 has 2 divisors, whose sum is σ = 143105562000. Its totient is φ = 143105561998.
The previous prime is 143105561993. The next prime is 143105562137. The reversal of 143105561999 is 999165501341.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 143105561999 - 24 = 143105561983 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143105561999.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143105561993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71552780999 + 71552781000.
It is an arithmetic number, because the mean of its divisors is an integer number (71552781000).
Almost surely, 2143105561999 is an apocalyptic number.
143105561999 is a deficient number, since it is larger than the sum of its proper divisors (1).
143105561999 is an equidigital number, since it uses as much as digits as its factorization.
143105561999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1312200, while the sum is 53.
The spelling of 143105561999 in words is "one hundred forty-three billion, one hundred five million, five hundred sixty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •