Base | Representation |
---|---|
bin | 11110011111011111000100… |
… | …000000000011101011001101 |
3 | 122120211022120200000022220002 |
4 | 132133133010000003223031 |
5 | 120034134121332414042 |
6 | 1153115002133534045 |
7 | 40150525132023611 |
oct | 3637370400035315 |
9 | 576738520008802 |
10 | 134105052232397 |
11 | 398036a6967974 |
12 | 1305a55a7a4325 |
13 | 59aa08a7a947c |
14 | 2518a0d539341 |
15 | 10785a80b1132 |
hex | 79f7c4003acd |
134105052232397 has 2 divisors, whose sum is σ = 134105052232398. Its totient is φ = 134105052232396.
The previous prime is 134105052232379. The next prime is 134105052232421. The reversal of 134105052232397 is 793232250501431.
Together with previous prime (134105052232379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132333986329801 + 1771065902596 = 11503651^2 + 1330814^2 .
It is a cyclic number.
It is not a de Polignac number, because 134105052232397 - 28 = 134105052232141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134105052232297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67052526116198 + 67052526116199.
It is an arithmetic number, because the mean of its divisors is an integer number (67052526116199).
Almost surely, 2134105052232397 is an apocalyptic number.
It is an amenable number.
134105052232397 is a deficient number, since it is larger than the sum of its proper divisors (1).
134105052232397 is an equidigital number, since it uses as much as digits as its factorization.
134105052232397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1360800, while the sum is 47.
The spelling of 134105052232397 in words is "one hundred thirty-four trillion, one hundred five billion, fifty-two million, two hundred thirty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •