Base | Representation |
---|---|
bin | 1111011110111111010110… |
… | …10011000111101110100111 |
3 | 11110120011101201212211212012 |
4 | 13233133223103013232213 |
5 | 13430334203233213133 |
6 | 200230231410544435 |
7 | 10113020354363021 |
oct | 757375323075647 |
9 | 143504351784765 |
10 | 34050153413543 |
11 | a938652a09623 |
12 | 399b19359811b |
13 | 15ccbb9a00237 |
14 | 85a071553011 |
15 | 3e0ac8d2eb48 |
hex | 1ef7eb4c7ba7 |
34050153413543 has 2 divisors, whose sum is σ = 34050153413544. Its totient is φ = 34050153413542.
The previous prime is 34050153413537. The next prime is 34050153413557. The reversal of 34050153413543 is 34531435105043.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 34050153413543 - 226 = 34050086304679 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 34050153413543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34050153413743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17025076706771 + 17025076706772.
It is an arithmetic number, because the mean of its divisors is an integer number (17025076706772).
Almost surely, 234050153413543 is an apocalyptic number.
34050153413543 is a deficient number, since it is larger than the sum of its proper divisors (1).
34050153413543 is an equidigital number, since it uses as much as digits as its factorization.
34050153413543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648000, while the sum is 41.
Adding to 34050153413543 its reverse (34531435105043), we get a palindrome (68581588518586).
The spelling of 34050153413543 in words is "thirty-four trillion, fifty billion, one hundred fifty-three million, four hundred thirteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •