Base | Representation |
---|---|
bin | 11110100010100111110000… |
… | …111011101001000101010101 |
3 | 122121120220211101101110022021 |
4 | 132202213300323221011111 |
5 | 120101201443412230141 |
6 | 1153402002201333141 |
7 | 40202224361242564 |
oct | 3642476073510525 |
9 | 577526741343267 |
10 | 134320554414421 |
11 | 39887033267951 |
12 | 13094281a971b1 |
13 | 59c44b26b19cb |
14 | 2525214403bdb |
15 | 107debc4946d1 |
hex | 7a29f0ee9155 |
134320554414421 has 2 divisors, whose sum is σ = 134320554414422. Its totient is φ = 134320554414420.
The previous prime is 134320554414377. The next prime is 134320554414427. The reversal of 134320554414421 is 124414455023431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114977367562500 + 19343186851921 = 10722750^2 + 4398089^2 .
It is a cyclic number.
It is not a de Polignac number, because 134320554414421 - 29 = 134320554413909 is a prime.
It is a super-2 number, since 2×1343205544144212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134320554414427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67160277207210 + 67160277207211.
It is an arithmetic number, because the mean of its divisors is an integer number (67160277207211).
Almost surely, 2134320554414421 is an apocalyptic number.
It is an amenable number.
134320554414421 is a deficient number, since it is larger than the sum of its proper divisors (1).
134320554414421 is an equidigital number, since it uses as much as digits as its factorization.
134320554414421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 921600, while the sum is 43.
The spelling of 134320554414421 in words is "one hundred thirty-four trillion, three hundred twenty billion, five hundred fifty-four million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •