Base | Representation |
---|---|
bin | 10111101100010101001001… |
… | …011011001010000010101011 |
3 | 111122221120010001112101211122 |
4 | 113230111021123022002223 |
5 | 102124214013424032133 |
6 | 1005341251102045455 |
7 | 30643206442044254 |
oct | 2754251133120253 |
9 | 448846101471748 |
10 | 104201433424043 |
11 | 3022464170770a |
12 | b82ab2927988b |
13 | 461b1cb212947 |
14 | 1ba353a765b2b |
15 | c0a7b9997498 |
hex | 5ec5496ca0ab |
104201433424043 has 2 divisors, whose sum is σ = 104201433424044. Its totient is φ = 104201433424042.
The previous prime is 104201433424007. The next prime is 104201433424057. The reversal of 104201433424043 is 340424334102401.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104201433424043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104201433423994 and 104201433424012.
It is not a weakly prime, because it can be changed into another prime (104201433424063) 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, 52100716712021 + 52100716712022.
It is an arithmetic number, because the mean of its divisors is an integer number (52100716712022).
Almost surely, 2104201433424043 is an apocalyptic number.
104201433424043 is a deficient number, since it is larger than the sum of its proper divisors (1).
104201433424043 is an equidigital number, since it uses as much as digits as its factorization.
104201433424043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 104201433424043 its reverse (340424334102401), we get a palindrome (444625767526444).
The spelling of 104201433424043 in words is "one hundred four trillion, two hundred one billion, four hundred thirty-three million, four hundred twenty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •