Base | Representation |
---|---|
bin | 11001001101000010… |
… | …01101100000001001 |
3 | 1021221000020020112002 |
4 | 30212201031200021 |
5 | 210202433022103 |
6 | 10114403200345 |
7 | 656212545014 |
oct | 144641154011 |
9 | 37830206462 |
10 | 13531142153 |
11 | 5813a82411 |
12 | 27576760b5 |
13 | 137843b8b9 |
14 | 92510a37b |
15 | 542dbc488 |
hex | 32684d809 |
13531142153 has 4 divisors (see below), whose sum is σ = 13590230340. Its totient is φ = 13472053968.
The previous prime is 13531142143. The next prime is 13531142159. The reversal of 13531142153 is 35124113531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6949389769 + 6581752384 = 83363^2 + 81128^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13531142153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13531142159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29543750 + ... + 29544207.
It is an arithmetic number, because the mean of its divisors is an integer number (3397557585).
Almost surely, 213531142153 is an apocalyptic number.
It is an amenable number.
13531142153 is a deficient number, since it is larger than the sum of its proper divisors (59088187).
13531142153 is an equidigital number, since it uses as much as digits as its factorization.
13531142153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59088186.
The product of its digits is 5400, while the sum is 29.
Adding to 13531142153 its reverse (35124113531), we get a palindrome (48655255684).
The spelling of 13531142153 in words is "thirteen billion, five hundred thirty-one million, one hundred forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •