Base | Representation |
---|---|
bin | 111110111011001111… |
… | …1110111101101110111 |
3 | 110220210120210111221112 |
4 | 1331312133313231313 |
5 | 4203222301133333 |
6 | 142025004505235 |
7 | 12522461331041 |
oct | 1756637675567 |
9 | 426716714845 |
10 | 135132052343 |
11 | 52344580002 |
12 | 2223354b21b |
13 | c9871ba0b2 |
14 | 677cd02a91 |
15 | 37ad6a1948 |
hex | 1f767f7b77 |
135132052343 has 4 divisors (see below), whose sum is σ = 135171145200. Its totient is φ = 135092959488.
The previous prime is 135132052333. The next prime is 135132052373. The reversal of 135132052343 is 343250231531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 343250231531 = 953 ⋅360178627.
It is a cyclic number.
It is not a de Polignac number, because 135132052343 - 214 = 135132035959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135132052333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19541243 + ... + 19548156.
It is an arithmetic number, because the mean of its divisors is an integer number (33792786300).
Almost surely, 2135132052343 is an apocalyptic number.
135132052343 is a deficient number, since it is larger than the sum of its proper divisors (39092857).
135132052343 is an equidigital number, since it uses as much as digits as its factorization.
135132052343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39092856.
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 135132052343 its reverse (343250231531), we get a palindrome (478382283874).
The spelling of 135132052343 in words is "one hundred thirty-five billion, one hundred thirty-two million, fifty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •