Base | Representation |
---|---|
bin | 10111101111110110100001… |
… | …001100110000100000110111 |
3 | 111200210200201210220011221121 |
4 | 113233312201030300200313 |
5 | 102142200113044304142 |
6 | 1010044351404324411 |
7 | 30666534262601533 |
oct | 2757664114604067 |
9 | 450720653804847 |
10 | 104443424213047 |
11 | 30308231152117 |
12 | b869a03543707 |
13 | 4637c84b8501a |
14 | 1bb1135592bc3 |
15 | c11c2e596c67 |
hex | 5efda1330837 |
104443424213047 has 2 divisors, whose sum is σ = 104443424213048. Its totient is φ = 104443424213046.
The previous prime is 104443424212987. The next prime is 104443424213087. The reversal of 104443424213047 is 740312424344401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104443424213047 - 223 = 104443415824439 is a prime.
It is a super-2 number, since 2×1044434242130472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104443424212994 and 104443424213012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104443424213087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52221712106523 + 52221712106524.
It is an arithmetic number, because the mean of its divisors is an integer number (52221712106524).
Almost surely, 2104443424213047 is an apocalyptic number.
104443424213047 is a deficient number, since it is larger than the sum of its proper divisors (1).
104443424213047 is an equidigital number, since it uses as much as digits as its factorization.
104443424213047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1032192, while the sum is 43.
Adding to 104443424213047 its reverse (740312424344401), we get a palindrome (844755848557448).
The spelling of 104443424213047 in words is "one hundred four trillion, four hundred forty-three billion, four hundred twenty-four million, two hundred thirteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •