Base | Representation |
---|---|
bin | 11110100011001000110101… |
… | …010011101010101001010011 |
3 | 122121201022110220212012100211 |
4 | 132203020311103222221103 |
5 | 120102242203143120311 |
6 | 1153430153353224551 |
7 | 40204622306635402 |
oct | 3643106523525123 |
9 | 577638426765324 |
10 | 134356061301331 |
11 | 398a00a3a49591 |
12 | 1309b131102157 |
13 | 59c795092c36c |
14 | 2526c21d79639 |
15 | 107ed9979d821 |
hex | 7a32354eaa53 |
134356061301331 has 8 divisors (see below), whose sum is σ = 134378625523520. Its totient is φ = 134333497844352.
The previous prime is 134356061301307. The next prime is 134356061301377. The reversal of 134356061301331 is 133103160653431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134356061301331 is a prime.
It is a super-3 number, since 3×1343560613013313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134356061301131) 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, 431068315 + ... + 431379883.
It is an arithmetic number, because the mean of its divisors is an integer number (16797328190440).
Almost surely, 2134356061301331 is an apocalyptic number.
134356061301331 is a deficient number, since it is larger than the sum of its proper divisors (22564222189).
134356061301331 is an equidigital number, since it uses as much as digits as its factorization.
134356061301331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 382605.
The product of its (nonzero) digits is 174960, while the sum is 40.
The spelling of 134356061301331 in words is "one hundred thirty-four trillion, three hundred fifty-six billion, sixty-one million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •