Base | Representation |
---|---|
bin | 11110011110010101011101… |
… | …011010010101001011011101 |
3 | 122120112202120220001001001122 |
4 | 132132111131122111023131 |
5 | 120031340243020432021 |
6 | 1153014412050220325 |
7 | 40142026521142001 |
oct | 3636253532251335 |
9 | 576482526031048 |
10 | 134026021655261 |
11 | 3978313119a60a |
12 | 130471835846a5 |
13 | 59a27a4466c68 |
14 | 2514c7342c701 |
15 | 10764cec83bab |
hex | 79e55d6952dd |
134026021655261 has 4 divisors (see below), whose sum is σ = 134026054744572. Its totient is φ = 134025988565952.
The previous prime is 134026021655257. The next prime is 134026021655347. The reversal of 134026021655261 is 162556120620431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5849795263225 + 128176226392036 = 2418635^2 + 11321494^2 .
It is a cyclic number.
It is not a de Polignac number, because 134026021655261 - 22 = 134026021655257 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134026021655861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9456860 + ... + 18907253.
It is an arithmetic number, because the mean of its divisors is an integer number (33506513686143).
Almost surely, 2134026021655261 is an apocalyptic number.
It is an amenable number.
134026021655261 is a deficient number, since it is larger than the sum of its proper divisors (33089311).
134026021655261 is an equidigital number, since it uses as much as digits as its factorization.
134026021655261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33089310.
The product of its (nonzero) digits is 518400, while the sum is 44.
The spelling of 134026021655261 in words is "one hundred thirty-four trillion, twenty-six billion, twenty-one million, six hundred fifty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •