Base | Representation |
---|---|
bin | 1000010110000100110… |
… | …1011101100100011111 |
3 | 111201001100020110002012 |
4 | 2011201031131210133 |
5 | 4322102344332321 |
6 | 145505542021435 |
7 | 13233500013422 |
oct | 2054115354437 |
9 | 451040213065 |
10 | 143364839711 |
11 | 55889795005 |
12 | 2395071787b |
13 | 10699a27102 |
14 | 6d204859b9 |
15 | 3ae133105b |
hex | 216135d91f |
143364839711 has 2 divisors, whose sum is σ = 143364839712. Its totient is φ = 143364839710.
The previous prime is 143364839707. The next prime is 143364839729. The reversal of 143364839711 is 117938463341.
143364839711 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 143364839711 - 22 = 143364839707 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143364839711.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143364839741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71682419855 + 71682419856.
It is an arithmetic number, because the mean of its divisors is an integer number (71682419856).
Almost surely, 2143364839711 is an apocalyptic number.
143364839711 is a deficient number, since it is larger than the sum of its proper divisors (1).
143364839711 is an equidigital number, since it uses as much as digits as its factorization.
143364839711 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1306368, while the sum is 50.
The spelling of 143364839711 in words is "one hundred forty-three billion, three hundred sixty-four million, eight hundred thirty-nine thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •