Base | Representation |
---|---|
bin | 111111000110101010… |
… | …1101010100110010111 |
3 | 110221210021212010121202 |
4 | 1332031111222212113 |
5 | 4210013401100033 |
6 | 142131014103115 |
7 | 12535123434404 |
oct | 1761525524627 |
9 | 427707763552 |
10 | 135515253143 |
11 | 52520911486 |
12 | 2231b94aa9b |
13 | ca186c912a |
14 | 67b7b732ab |
15 | 37d21478e8 |
hex | 1f8d56a997 |
135515253143 has 4 divisors (see below), whose sum is σ = 143486738640. Its totient is φ = 127543767648.
The previous prime is 135515253101. The next prime is 135515253161. The reversal of 135515253143 is 341352515531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 135515253143 - 216 = 135515187607 is a prime.
It is a super-2 number, since 2×1355152531432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135515253097 and 135515253106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135515253343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3985742723 + ... + 3985742756.
It is an arithmetic number, because the mean of its divisors is an integer number (35871684660).
Almost surely, 2135515253143 is an apocalyptic number.
135515253143 is a deficient number, since it is larger than the sum of its proper divisors (7971485497).
135515253143 is an equidigital number, since it uses as much as digits as its factorization.
135515253143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7971485496.
The product of its digits is 135000, while the sum is 38.
Adding to 135515253143 its reverse (341352515531), we get a palindrome (476867768674).
The spelling of 135515253143 in words is "one hundred thirty-five billion, five hundred fifteen million, two hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •