Base | Representation |
---|---|
bin | 110001011000001100100101… |
… | …0100001010001110100110011 |
3 | 2002221211221021010020012212201 |
4 | 1202300121022201101310303 |
5 | 423412112230412404133 |
6 | 4135430200441404031 |
7 | 160325414134154005 |
oct | 14260311241216463 |
9 | 2087757233205781 |
10 | 434334113013043 |
11 | 116435076802181 |
12 | 40868a3b799617 |
13 | 158476b9b19739 |
14 | 7937c51852375 |
15 | 35330612e5d7d |
hex | 18b064a851d33 |
434334113013043 has 2 divisors, whose sum is σ = 434334113013044. Its totient is φ = 434334113013042.
The previous prime is 434334113013007. The next prime is 434334113013049. The reversal of 434334113013043 is 340310311433434.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-434334113013043 is a prime.
It is a super-2 number, since 2×4343341130130432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 434334113012993 and 434334113013011.
It is not a weakly prime, because it can be changed into another prime (434334113013049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217167056506521 + 217167056506522.
It is an arithmetic number, because the mean of its divisors is an integer number (217167056506522).
Almost surely, 2434334113013043 is an apocalyptic number.
434334113013043 is a deficient number, since it is larger than the sum of its proper divisors (1).
434334113013043 is an equidigital number, since it uses as much as digits as its factorization.
434334113013043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 37.
Adding to 434334113013043 its reverse (340310311433434), we get a palindrome (774644424446477).
The spelling of 434334113013043 in words is "four hundred thirty-four trillion, three hundred thirty-four billion, one hundred thirteen million, thirteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •