Base | Representation |
---|---|
bin | 1000010101100000000… |
… | …1010101000011000011 |
3 | 111200122121010111221112 |
4 | 2011120001111003003 |
5 | 4321243412223011 |
6 | 145442353313535 |
7 | 13226615363063 |
oct | 2053001250303 |
9 | 450577114845 |
10 | 143210664131 |
11 | 5580a760677 |
12 | 23908b658ab |
13 | 10673ac5762 |
14 | 6d07bd13a3 |
15 | 3ad2a2958b |
hex | 21580550c3 |
143210664131 has 2 divisors, whose sum is σ = 143210664132. Its totient is φ = 143210664130.
The previous prime is 143210664109. The next prime is 143210664173. The reversal of 143210664131 is 131466012341.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143210664131 is a prime.
It is a super-2 number, since 2×1432106641312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (143210664101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71605332065 + 71605332066.
It is an arithmetic number, because the mean of its divisors is an integer number (71605332066).
Almost surely, 2143210664131 is an apocalyptic number.
143210664131 is a deficient number, since it is larger than the sum of its proper divisors (1).
143210664131 is an equidigital number, since it uses as much as digits as its factorization.
143210664131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 143210664131 its reverse (131466012341), we get a palindrome (274676676472).
The spelling of 143210664131 in words is "one hundred forty-three billion, two hundred ten million, six hundred sixty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •