Base | Representation |
---|---|
bin | 111110011010010011… |
… | …0011001000001010001 |
3 | 110210221112102212201112 |
4 | 1330310212121001101 |
5 | 4143441233342421 |
6 | 141323152143105 |
7 | 12453205105265 |
oct | 1746446310121 |
9 | 423845385645 |
10 | 134026465361 |
11 | 5192749a158 |
12 | 21b85237a95 |
13 | c83c131409 |
14 | 66b614c0a5 |
15 | 37465b545b |
hex | 1f34999051 |
134026465361 has 4 divisors (see below), whose sum is σ = 134029590000. Its totient is φ = 134023340724.
The previous prime is 134026465343. The next prime is 134026465429. The reversal of 134026465361 is 163564620431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 163564620431 = 3767 ⋅43420393.
It is a cyclic number.
It is not a de Polignac number, because 134026465361 - 210 = 134026464337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134026065361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1497071 + ... + 1584068.
It is an arithmetic number, because the mean of its divisors is an integer number (33507397500).
Almost surely, 2134026465361 is an apocalyptic number.
It is an amenable number.
134026465361 is a deficient number, since it is larger than the sum of its proper divisors (3124639).
134026465361 is an equidigital number, since it uses as much as digits as its factorization.
134026465361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3124638.
The product of its (nonzero) digits is 311040, while the sum is 41.
The spelling of 134026465361 in words is "one hundred thirty-four billion, twenty-six million, four hundred sixty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •