Base | Representation |
---|---|
bin | 11110011111110111011011… |
… | …111010100010111001111101 |
3 | 122120220211010120101111012102 |
4 | 132133313123322202321331 |
5 | 120040101221122310123 |
6 | 1153135011105314445 |
7 | 40152442515661313 |
oct | 3637673372427175 |
9 | 576824116344172 |
10 | 134131223244413 |
11 | 3981380680061a |
12 | 13063643335a25 |
13 | 59ac69b7c79b5 |
14 | 2519db32280b3 |
15 | 10790da995028 |
hex | 79fddbea2e7d |
134131223244413 has 2 divisors, whose sum is σ = 134131223244414. Its totient is φ = 134131223244412.
The previous prime is 134131223244409. The next prime is 134131223244433. The reversal of 134131223244413 is 314442322131431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131909773099204 + 2221450145209 = 11485198^2 + 1490453^2 .
It is a cyclic number.
It is not a de Polignac number, because 134131223244413 - 22 = 134131223244409 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134131223244433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67065611622206 + 67065611622207.
It is an arithmetic number, because the mean of its divisors is an integer number (67065611622207).
Almost surely, 2134131223244413 is an apocalyptic number.
It is an amenable number.
134131223244413 is a deficient number, since it is larger than the sum of its proper divisors (1).
134131223244413 is an equidigital number, since it uses as much as digits as its factorization.
134131223244413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 165888, while the sum is 38.
Adding to 134131223244413 its reverse (314442322131431), we get a palindrome (448573545375844).
The spelling of 134131223244413 in words is "one hundred thirty-four trillion, one hundred thirty-one billion, two hundred twenty-three million, two hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •