Base | Representation |
---|---|
bin | 11110011111101111001111… |
… | …011001000011000110110111 |
3 | 122120212222102021120000202012 |
4 | 132133233033121003012313 |
5 | 120034430210314432411 |
6 | 1153130553550034435 |
7 | 40152011451600542 |
oct | 3637571731030667 |
9 | 576788367500665 |
10 | 134122423202231 |
11 | 39810000373692 |
12 | 130619a81a8a1b |
13 | 59ab8c85b8749 |
14 | 25197ba5c3859 |
15 | 1078c7311518b |
hex | 79fbcf6431b7 |
134122423202231 has 2 divisors, whose sum is σ = 134122423202232. Its totient is φ = 134122423202230.
The previous prime is 134122423202171. The next prime is 134122423202279. The reversal of 134122423202231 is 132202324221431.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134122423202231 is a prime.
It is a super-2 number, since 2×1341224232022312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134122423202531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67061211601115 + 67061211601116.
It is an arithmetic number, because the mean of its divisors is an integer number (67061211601116).
Almost surely, 2134122423202231 is an apocalyptic number.
134122423202231 is a deficient number, since it is larger than the sum of its proper divisors (1).
134122423202231 is an equidigital number, since it uses as much as digits as its factorization.
134122423202231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 134122423202231 its reverse (132202324221431), we get a palindrome (266324747423662).
The spelling of 134122423202231 in words is "one hundred thirty-four trillion, one hundred twenty-two billion, four hundred twenty-three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •