Base | Representation |
---|---|
bin | 11110100011110010110010… |
… | …110000010101100010111111 |
3 | 122121212121202211112211212121 |
4 | 132203302302300111202333 |
5 | 120104011441101021142 |
6 | 1153503004204143411 |
7 | 40211105636340412 |
oct | 3643626260254277 |
9 | 577777684484777 |
10 | 134401115642047 |
11 | 39908213a4a611 |
12 | 130a7a05837b67 |
13 | 59cbc80b88577 |
14 | 2529097911b79 |
15 | 1081134d72c67 |
hex | 7a3cb2c158bf |
134401115642047 has 2 divisors, whose sum is σ = 134401115642048. Its totient is φ = 134401115642046.
The previous prime is 134401115642023. The next prime is 134401115642083. The reversal of 134401115642047 is 740246511104431.
It is a weak prime.
It is an emirp because it is prime and its reverse (740246511104431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134401115642047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134401115641994 and 134401115642012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134401115342047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67200557821023 + 67200557821024.
It is an arithmetic number, because the mean of its divisors is an integer number (67200557821024).
Almost surely, 2134401115642047 is an apocalyptic number.
134401115642047 is a deficient number, since it is larger than the sum of its proper divisors (1).
134401115642047 is an equidigital number, since it uses as much as digits as its factorization.
134401115642047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 322560, while the sum is 43.
Adding to 134401115642047 its reverse (740246511104431), we get a palindrome (874647626746478).
The spelling of 134401115642047 in words is "one hundred thirty-four trillion, four hundred one billion, one hundred fifteen million, six hundred forty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •