Base | Representation |
---|---|
bin | 1000010101001001000… |
… | …1010111100101000111 |
3 | 111200101212121220121001 |
4 | 2011102101113211013 |
5 | 4321044214034021 |
6 | 145425030034131 |
7 | 13224334450444 |
oct | 2052221274507 |
9 | 450355556531 |
10 | 143114205511 |
11 | 55770268902 |
12 | 238a07a8947 |
13 | 10659b21b54 |
14 | 6cd90829cb |
15 | 3ac9324091 |
hex | 2152457947 |
143114205511 has 2 divisors, whose sum is σ = 143114205512. Its totient is φ = 143114205510.
The previous prime is 143114205497. The next prime is 143114205517. The reversal of 143114205511 is 115502411341.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 143114205511 - 237 = 5675252039 is a prime.
It is a super-2 number, since 2×1431142055112 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 143114205511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143114205517) 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, 71557102755 + 71557102756.
It is an arithmetic number, because the mean of its divisors is an integer number (71557102756).
Almost surely, 2143114205511 is an apocalyptic number.
143114205511 is a deficient number, since it is larger than the sum of its proper divisors (1).
143114205511 is an equidigital number, since it uses as much as digits as its factorization.
143114205511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 143114205511 its reverse (115502411341), we get a palindrome (258616616852).
The spelling of 143114205511 in words is "one hundred forty-three billion, one hundred fourteen million, two hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •