Base | Representation |
---|---|
bin | 10011100011110110001001… |
… | …10011001001010101000111 |
3 | 12122022000100012010212011102 |
4 | 21301323010303021111013 |
5 | 21114211314141302124 |
6 | 231251540341130315 |
7 | 12026410551404666 |
oct | 1161730463112507 |
9 | 178260305125142 |
10 | 43013104244039 |
11 | 12783833aa62a6 |
12 | 49a82896b999b |
13 | 1b0016cc67807 |
14 | a89bb9914ddd |
15 | 4e8d09b04aae |
hex | 271ec4cc9547 |
43013104244039 has 2 divisors, whose sum is σ = 43013104244040. Its totient is φ = 43013104244038.
The previous prime is 43013104244021. The next prime is 43013104244053. The reversal of 43013104244039 is 93044240131034.
43013104244039 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 43013104244039 - 220 = 43013103195463 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43013104243993 and 43013104244011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43013104244239) 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, 21506552122019 + 21506552122020.
It is an arithmetic number, because the mean of its divisors is an integer number (21506552122020).
Almost surely, 243013104244039 is an apocalyptic number.
43013104244039 is a deficient number, since it is larger than the sum of its proper divisors (1).
43013104244039 is an equidigital number, since it uses as much as digits as its factorization.
43013104244039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 43013104244039 in words is "forty-three trillion, thirteen billion, one hundred four million, two hundred forty-four thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •