Base | Representation |
---|---|
bin | 11110110010101101010110… |
… | …100001110011111101100101 |
3 | 122202111121100100120002212212 |
4 | 132302231112201303331211 |
5 | 120222310040232424331 |
6 | 1200005513045053205 |
7 | 40345132102452050 |
oct | 3662552641637545 |
9 | 582447310502785 |
10 | 135426065514341 |
11 | 3a172965483878 |
12 | 1323258b3b7205 |
13 | 5a74814189044 |
14 | 25629297b3a97 |
15 | 109cb21ba8d2b |
hex | 7b2b56873f65 |
135426065514341 has 8 divisors (see below), whose sum is σ = 154883277225600. Its totient is φ = 115996511533968.
The previous prime is 135426065514307. The next prime is 135426065514409. The reversal of 135426065514341 is 143415560624531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135426065514341 - 26 = 135426065514277 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 135426065514341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135426065514301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6914422226 + ... + 6914441811.
It is an arithmetic number, because the mean of its divisors is an integer number (19360409653200).
Almost surely, 2135426065514341 is an apocalyptic number.
It is an amenable number.
135426065514341 is a deficient number, since it is larger than the sum of its proper divisors (19457211711259).
135426065514341 is a wasteful number, since it uses less digits than its factorization.
135426065514341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13828865443.
The product of its (nonzero) digits is 5184000, while the sum is 50.
The spelling of 135426065514341 in words is "one hundred thirty-five trillion, four hundred twenty-six billion, sixty-five million, five hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •