Base | Representation |
---|---|
bin | 1011101100111100011… |
… | …1011010001001011111 |
3 | 201012221001110220110012 |
4 | 2323033013122021133 |
5 | 11243214042241224 |
6 | 232205200033435 |
7 | 20345020015322 |
oct | 2731707321137 |
9 | 635831426405 |
10 | 201043321439 |
11 | 78297794024 |
12 | 32b6900287b |
13 | 15c5c51693c |
14 | 9a328a87b9 |
15 | 5369d6180e |
hex | 2ecf1da25f |
201043321439 has 2 divisors, whose sum is σ = 201043321440. Its totient is φ = 201043321438.
The previous prime is 201043321429. The next prime is 201043321447. The reversal of 201043321439 is 934123340102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201043321439 is a prime.
It is a super-3 number, since 3×2010433214393 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201043321429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100521660719 + 100521660720.
It is an arithmetic number, because the mean of its divisors is an integer number (100521660720).
Almost surely, 2201043321439 is an apocalyptic number.
201043321439 is a deficient number, since it is larger than the sum of its proper divisors (1).
201043321439 is an equidigital number, since it uses as much as digits as its factorization.
201043321439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 201043321439 in words is "two hundred one billion, forty-three million, three hundred twenty-one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •