Base | Representation |
---|---|
bin | 111110100011110011… |
… | …0000011010000111001 |
3 | 110211202202002101202010 |
4 | 1331013212003100321 |
5 | 4200114324041403 |
6 | 141414534400133 |
7 | 12464124606531 |
oct | 1750746032071 |
9 | 424682071663 |
10 | 134345143353 |
11 | 51a803706a3 |
12 | 22053b00049 |
13 | c89016b985 |
14 | 67065c44c1 |
15 | 3764563603 |
hex | 1f47983439 |
134345143353 has 8 divisors (see below), whose sum is σ = 179151935616. Its totient is φ = 89550890000.
The previous prime is 134345143327. The next prime is 134345143363. The reversal of 134345143353 is 353341543431.
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-134345143353 is a prime.
It is a super-3 number, since 3×1343451433533 (a number of 34 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (134345143363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3109698 + ... + 3152603.
It is an arithmetic number, because the mean of its divisors is an integer number (22393991952).
Almost surely, 2134345143353 is an apocalyptic number.
It is an amenable number.
134345143353 is a deficient number, since it is larger than the sum of its proper divisors (44806792263).
134345143353 is an equidigital number, since it uses as much as digits as its factorization.
134345143353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6269455.
The product of its digits is 388800, while the sum is 39.
Adding to 134345143353 its reverse (353341543431), we get a palindrome (487686686784).
The spelling of 134345143353 in words is "one hundred thirty-four billion, three hundred forty-five million, one hundred forty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •