Base | Representation |
---|---|
bin | 1000010101111010011… |
… | …0010011101000100111 |
3 | 111200221021210020001202 |
4 | 2011132212103220213 |
5 | 4322010140132332 |
6 | 145501334513115 |
7 | 13232425402115 |
oct | 2053646235047 |
9 | 450837706052 |
10 | 143321020967 |
11 | 55866a86373 |
12 | 23939b0579b |
13 | 10690924367 |
14 | 6d1871aab5 |
15 | 3adc577a62 |
hex | 215e993a27 |
143321020967 has 2 divisors, whose sum is σ = 143321020968. Its totient is φ = 143321020966.
The previous prime is 143321020933. The next prime is 143321020979. The reversal of 143321020967 is 769020123341.
143321020967 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 143321020967 - 212 = 143321016871 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143321020967.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143321020907) 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, 71660510483 + 71660510484.
It is an arithmetic number, because the mean of its divisors is an integer number (71660510484).
Almost surely, 2143321020967 is an apocalyptic number.
143321020967 is a deficient number, since it is larger than the sum of its proper divisors (1).
143321020967 is an equidigital number, since it uses as much as digits as its factorization.
143321020967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 38.
The spelling of 143321020967 in words is "one hundred forty-three billion, three hundred twenty-one million, twenty thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •