Base | Representation |
---|---|
bin | 111110100011011100… |
… | …0100001111011100111 |
3 | 110211201220122010201210 |
4 | 1331012320201323213 |
5 | 4200103300212333 |
6 | 141413430522503 |
7 | 12463621306443 |
oct | 1750670417347 |
9 | 424656563653 |
10 | 134333210343 |
11 | 51a74660202 |
12 | 2204bb06433 |
13 | c88a851317 |
14 | 6704b99823 |
15 | 37634a7a63 |
hex | 1f46e21ee7 |
134333210343 has 8 divisors (see below), whose sum is σ = 185287186800. Its totient is φ = 86467353728.
The previous prime is 134333210311. The next prime is 134333210351. The reversal of 134333210343 is 343012333431.
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 134333210343 - 25 = 134333210311 is a prime.
It is a super-2 number, since 2×1343332103432 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 134333210343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134333211343) 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, 772029858 + ... + 772030031.
It is an arithmetic number, because the mean of its divisors is an integer number (23160898350).
Almost surely, 2134333210343 is an apocalyptic number.
134333210343 is a deficient number, since it is larger than the sum of its proper divisors (50953976457).
134333210343 is a wasteful number, since it uses less digits than its factorization.
134333210343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1544059921.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 134333210343 its reverse (343012333431), we get a palindrome (477345543774).
The spelling of 134333210343 in words is "one hundred thirty-four billion, three hundred thirty-three million, two hundred ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •