Base | Representation |
---|---|
bin | 111110100011011010… |
… | …1011111110111100101 |
3 | 110211201212010202100201 |
4 | 1331012311133313211 |
5 | 4200103044243321 |
6 | 141413401510501 |
7 | 12463611456136 |
oct | 1750665376745 |
9 | 424655122321 |
10 | 134332415461 |
11 | 51a74167a82 |
12 | 2204b7a2431 |
13 | c88a63358a |
14 | 6704a2dc8d |
15 | 376339c291 |
hex | 1f46d5fde5 |
134332415461 has 2 divisors, whose sum is σ = 134332415462. Its totient is φ = 134332415460.
The previous prime is 134332415419. The next prime is 134332415467. The reversal of 134332415461 is 164514233431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110552925025 + 23779490436 = 332495^2 + 154206^2 .
It is an emirp because it is prime and its reverse (164514233431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 134332415461 - 27 = 134332415333 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134332415461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134332415467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67166207730 + 67166207731.
It is an arithmetic number, because the mean of its divisors is an integer number (67166207731).
Almost surely, 2134332415461 is an apocalyptic number.
It is an amenable number.
134332415461 is a deficient number, since it is larger than the sum of its proper divisors (1).
134332415461 is an equidigital number, since it uses as much as digits as its factorization.
134332415461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 37.
Adding to 134332415461 its reverse (164514233431), we get a palindrome (298846648892).
The spelling of 134332415461 in words is "one hundred thirty-four billion, three hundred thirty-two million, four hundred fifteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •