Base | Representation |
---|---|
bin | 111110011101110010… |
… | …0001111101101000111 |
3 | 110211020200100220021221 |
4 | 1330323210033231013 |
5 | 4144211143442211 |
6 | 141342525221211 |
7 | 12456124414546 |
oct | 1747344175507 |
9 | 424220326257 |
10 | 134143343431 |
11 | 519874693a9 |
12 | 21bb8401807 |
13 | c85a404336 |
14 | 66c789415d |
15 | 37519a0c71 |
hex | 1f3b90fb47 |
134143343431 has 8 divisors (see below), whose sum is σ = 136056143664. Its totient is φ = 132232576320.
The previous prime is 134143343423. The next prime is 134143343479. The reversal of 134143343431 is 134343341431.
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 134143343431 - 23 = 134143343423 is a prime.
It is a super-2 number, since 2×1341433434312 (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 (134143353431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 375136 + ... + 639541.
It is an arithmetic number, because the mean of its divisors is an integer number (17007017958).
Almost surely, 2134143343431 is an apocalyptic number.
134143343431 is a deficient number, since it is larger than the sum of its proper divisors (1912800233).
134143343431 is a wasteful number, since it uses less digits than its factorization.
134143343431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016561.
The product of its digits is 62208, while the sum is 34.
Adding to 134143343431 its reverse (134343341431), we get a palindrome (268486684862).
The spelling of 134143343431 in words is "one hundred thirty-four billion, one hundred forty-three million, three hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •