Base | Representation |
---|---|
bin | 111110100011101111… |
… | …1000100100001100111 |
3 | 110211202121122102200012 |
4 | 1331013133010201213 |
5 | 4200113342013021 |
6 | 141414431240435 |
7 | 12464103215651 |
oct | 1750737044147 |
9 | 424677572605 |
10 | 134343313511 |
11 | 51a7a330930 |
12 | 2205337911b |
13 | c88c97ab24 |
14 | 67062696d1 |
15 | 376430135b |
hex | 1f477c4867 |
134343313511 has 8 divisors (see below), whose sum is σ = 146559260304. Its totient is φ = 122127853120.
The previous prime is 134343313483. The next prime is 134343313523. The reversal of 134343313511 is 115313343431.
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-134343313511 is a prime.
It is a super-2 number, since 2×1343433135112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134343313541) 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, 693491 + ... + 865803.
It is an arithmetic number, because the mean of its divisors is an integer number (18319907538).
Almost surely, 2134343313511 is an apocalyptic number.
134343313511 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
134343313511 is a deficient number, since it is larger than the sum of its proper divisors (12215946793).
134343313511 is a wasteful number, since it uses less digits than its factorization.
134343313511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243201.
The product of its digits is 19440, while the sum is 32.
Adding to 134343313511 its reverse (115313343431), we get a palindrome (249656656942).
The spelling of 134343313511 in words is "one hundred thirty-four billion, three hundred forty-three million, three hundred thirteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •