Base | Representation |
---|---|
bin | 11110100010110000101010… |
… | …101011111110010111010001 |
3 | 122121121211111120011012012002 |
4 | 132202300222223332113101 |
5 | 120101331033002223101 |
6 | 1153410222510043345 |
7 | 40203013301510255 |
oct | 3642605253762721 |
9 | 577554446135162 |
10 | 134330113320401 |
11 | 39890098a99449 |
12 | 130960ab1a9555 |
13 | 59c5376ba00ab |
14 | 252587db46265 |
15 | 107e37b772d6b |
hex | 7a2c2aafe5d1 |
134330113320401 has 2 divisors, whose sum is σ = 134330113320402. Its totient is φ = 134330113320400.
The previous prime is 134330113320349. The next prime is 134330113320421. The reversal of 134330113320401 is 104023311033431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70390019295376 + 63940094025025 = 8389876^2 + 7996255^2 .
It is a cyclic number.
It is not a de Polignac number, because 134330113320401 - 210 = 134330113319377 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (134330113320421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67165056660200 + 67165056660201.
It is an arithmetic number, because the mean of its divisors is an integer number (67165056660201).
Almost surely, 2134330113320401 is an apocalyptic number.
It is an amenable number.
134330113320401 is a deficient number, since it is larger than the sum of its proper divisors (1).
134330113320401 is an equidigital number, since it uses as much as digits as its factorization.
134330113320401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 134330113320401 its reverse (104023311033431), we get a palindrome (238353424353832).
The spelling of 134330113320401 in words is "one hundred thirty-four trillion, three hundred thirty billion, one hundred thirteen million, three hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •