Base | Representation |
---|---|
bin | 111110100011001001… |
… | …0111011001010110011 |
3 | 110211201020002021221222 |
4 | 1331012102323022303 |
5 | 4200043234232433 |
6 | 141412435335255 |
7 | 12463441440563 |
oct | 1750622731263 |
9 | 424636067858 |
10 | 134323352243 |
11 | 51a6a037713 |
12 | 2204875152b |
13 | c8887ac222 |
14 | 6703750da3 |
15 | 37626abb98 |
hex | 1f464bb2b3 |
134323352243 has 4 divisors (see below), whose sum is σ = 137599531608. Its totient is φ = 131047172880.
The previous prime is 134323352213. The next prime is 134323352287. The reversal of 134323352243 is 342253323431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 342253323431 = 29 ⋅11801838739.
It is a cyclic number.
It is not a de Polignac number, because 134323352243 - 26 = 134323352179 is a prime.
It is a super-3 number, since 3×1343233522433 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134323352213) 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, 1638089621 + ... + 1638089702.
It is an arithmetic number, because the mean of its divisors is an integer number (34399882902).
Almost surely, 2134323352243 is an apocalyptic number.
134323352243 is a deficient number, since it is larger than the sum of its proper divisors (3276179365).
134323352243 is an equidigital number, since it uses as much as digits as its factorization.
134323352243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276179364.
The product of its digits is 155520, while the sum is 35.
Adding to 134323352243 its reverse (342253323431), we get a palindrome (476576675674).
The spelling of 134323352243 in words is "one hundred thirty-four billion, three hundred twenty-three million, three hundred fifty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •