Base | Representation |
---|---|
bin | 111110100010001110… |
… | …1111110100110010001 |
3 | 110211122002101202201212 |
4 | 1331010131332212101 |
5 | 4200012412223231 |
6 | 141405422305505 |
7 | 12462620035262 |
oct | 1750435764621 |
9 | 424562352655 |
10 | 134292695441 |
11 | 51a537a8813 |
12 | 2203a428295 |
13 | c8823372c8 |
14 | 66dd650969 |
15 | 375eb5342b |
hex | 1f4477e991 |
134292695441 has 2 divisors, whose sum is σ = 134292695442. Its totient is φ = 134292695440.
The previous prime is 134292695357. The next prime is 134292695443. The reversal of 134292695441 is 144596292431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74267695441 + 60025000000 = 272521^2 + 245000^2 .
It is an emirp because it is prime and its reverse (144596292431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134292695441 is a prime.
Together with 134292695443, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134292695441.
It is not a weakly prime, because it can be changed into another prime (134292695443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67146347720 + 67146347721.
It is an arithmetic number, because the mean of its divisors is an integer number (67146347721).
Almost surely, 2134292695441 is an apocalyptic number.
It is an amenable number.
134292695441 is a deficient number, since it is larger than the sum of its proper divisors (1).
134292695441 is an equidigital number, since it uses as much as digits as its factorization.
134292695441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1866240, while the sum is 50.
The spelling of 134292695441 in words is "one hundred thirty-four billion, two hundred ninety-two million, six hundred ninety-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •