Base | Representation |
---|---|
bin | 11110100011001111110001… |
… | …011110110101101110100011 |
3 | 122121202000201021010200020212 |
4 | 132203033301132311232203 |
5 | 120102402433402023321 |
6 | 1153433425035524335 |
7 | 40205305054666436 |
oct | 3643176136655643 |
9 | 577660637120225 |
10 | 134363513314211 |
11 | 398a3278464115 |
12 | 130a06708b96ab |
13 | 59c856a78823c |
14 | 252732b95981d |
15 | 1080183b0255b |
hex | 7a33f17b5ba3 |
134363513314211 has 2 divisors, whose sum is σ = 134363513314212. Its totient is φ = 134363513314210.
The previous prime is 134363513314139. The next prime is 134363513314229. The reversal of 134363513314211 is 112413315363431.
It is a strong prime.
It is an emirp because it is prime and its reverse (112413315363431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 134363513314211 - 238 = 134088635407267 is a prime.
It is not a weakly prime, because it can be changed into another prime (134363513314231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67181756657105 + 67181756657106.
It is an arithmetic number, because the mean of its divisors is an integer number (67181756657106).
Almost surely, 2134363513314211 is an apocalyptic number.
134363513314211 is a deficient number, since it is larger than the sum of its proper divisors (1).
134363513314211 is an equidigital number, since it uses as much as digits as its factorization.
134363513314211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 233280, while the sum is 41.
Adding to 134363513314211 its reverse (112413315363431), we get a palindrome (246776828677642).
The spelling of 134363513314211 in words is "one hundred thirty-four trillion, three hundred sixty-three billion, five hundred thirteen million, three hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •