Base | Representation |
---|---|
bin | 111110100011101011… |
… | …1110110110010010111 |
3 | 110211202111002100022210 |
4 | 1331013113312302113 |
5 | 4200112401002411 |
6 | 141414322524503 |
7 | 12464051151012 |
oct | 1750727666227 |
9 | 424674070283 |
10 | 134341422231 |
11 | 51a79259995 |
12 | 22052806733 |
13 | c88c468023 |
14 | 6705cd6379 |
15 | 376407aca6 |
hex | 1f475f6c97 |
134341422231 has 8 divisors (see below), whose sum is σ = 179400471040. Its totient is φ = 89421660792.
The previous prime is 134341422221. The next prime is 134341422247. The reversal of 134341422231 is 132224143431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134341422231 - 215 = 134341389463 is a prime.
It is a super-2 number, since 2×1343414222312 (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 (134341422221) 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, 34819591 + ... + 34823448.
It is an arithmetic number, because the mean of its divisors is an integer number (22425058880).
Almost surely, 2134341422231 is an apocalyptic number.
134341422231 is a deficient number, since it is larger than the sum of its proper divisors (45059048809).
134341422231 is an equidigital number, since it uses as much as digits as its factorization.
134341422231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69643685.
The product of its digits is 13824, while the sum is 30.
Adding to 134341422231 its reverse (132224143431), we get a palindrome (266565565662).
It can be divided in two parts, 13434 and 1422231, that added together give a triangular number (1435665 = T1694).
The spelling of 134341422231 in words is "one hundred thirty-four billion, three hundred forty-one million, four hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •