Base | Representation |
---|---|
bin | 1000010110011101110… |
… | …0001110010110001011 |
3 | 111201022121221021112111 |
4 | 2011213130032112023 |
5 | 4322311124412221 |
6 | 145524154323151 |
7 | 13236206355562 |
oct | 2054734162613 |
9 | 451277837474 |
10 | 143469372811 |
11 | 559327a22a6 |
12 | 2397b7294b7 |
13 | 106b559700b |
14 | 6d302d6bd9 |
15 | 3aea5cdbe1 |
hex | 216770e58b |
143469372811 has 2 divisors, whose sum is σ = 143469372812. Its totient is φ = 143469372810.
The previous prime is 143469372743. The next prime is 143469372881. The reversal of 143469372811 is 118273964341.
143469372811 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 143469372811 - 217 = 143469241739 is a prime.
It is not a weakly prime, because it can be changed into another prime (143469372881) 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, 71734686405 + 71734686406.
It is an arithmetic number, because the mean of its divisors is an integer number (71734686406).
Almost surely, 2143469372811 is an apocalyptic number.
143469372811 is a deficient number, since it is larger than the sum of its proper divisors (1).
143469372811 is an equidigital number, since it uses as much as digits as its factorization.
143469372811 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 870912, while the sum is 49.
The spelling of 143469372811 in words is "one hundred forty-three billion, four hundred sixty-nine million, three hundred seventy-two thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •