Base | Representation |
---|---|
bin | 11110100010111011110111… |
… | …100110110001100010111011 |
3 | 122121122222112210202212000221 |
4 | 132202323313212301202323 |
5 | 120102030201123033201 |
6 | 1153415532213440511 |
7 | 40203620332130101 |
oct | 3642736746614273 |
9 | 577588483685027 |
10 | 134342141221051 |
11 | 39895200477205 |
12 | 130984a7340137 |
13 | 59c6542a5317a |
14 | 25262a1347c71 |
15 | 107e8326a54a1 |
hex | 7a2ef79b18bb |
134342141221051 has 2 divisors, whose sum is σ = 134342141221052. Its totient is φ = 134342141221050.
The previous prime is 134342141220919. The next prime is 134342141221061. The reversal of 134342141221051 is 150122141243431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 134342141221051 - 219 = 134342140696763 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134342141220998 and 134342141221016.
It is not a weakly prime, because it can be changed into another prime (134342141221061) 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, 67171070610525 + 67171070610526.
It is an arithmetic number, because the mean of its divisors is an integer number (67171070610526).
Almost surely, 2134342141221051 is an apocalyptic number.
134342141221051 is a deficient number, since it is larger than the sum of its proper divisors (1).
134342141221051 is an equidigital number, since it uses as much as digits as its factorization.
134342141221051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 134342141221051 its reverse (150122141243431), we get a palindrome (284464282464482).
The spelling of 134342141221051 in words is "one hundred thirty-four trillion, three hundred forty-two billion, one hundred forty-one million, two hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •