Base | Representation |
---|---|
bin | 11001001110010110… |
… | …01001011010010000 |
3 | 1021221202220202110212 |
4 | 30213023021122100 |
5 | 210213241313230 |
6 | 10115434543252 |
7 | 656405152301 |
oct | 144713113220 |
9 | 37852822425 |
10 | 13542135440 |
11 | 581a200879 |
12 | 275b297b28 |
13 | 137a7ba5c2 |
14 | 92676c7a8 |
15 | 543d3e895 |
hex | 3272c9690 |
13542135440 has 20 divisors (see below), whose sum is σ = 31485465084. Its totient is φ = 5416854144.
The previous prime is 13542135433. The next prime is 13542135443. The reversal of 13542135440 is 4453124531.
It can be written as a sum of positive squares in 2 ways, for example, as 3544535296 + 9997600144 = 59536^2 + 99988^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a junction number, because it is equal to n+sod(n) for n = 13542135397 and 13542135406.
It is not an unprimeable number, because it can be changed into a prime (13542135443) 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, 84638267 + ... + 84638426.
Almost surely, 213542135440 is an apocalyptic number.
13542135440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13542135440 is an abundant number, since it is smaller than the sum of its proper divisors (17943329644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13542135440 is a wasteful number, since it uses less digits than its factorization.
13542135440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169276706 (or 169276700 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 13542135440 its reverse (4453124531), we get a palindrome (17995259971).
The spelling of 13542135440 in words is "thirteen billion, five hundred forty-two million, one hundred thirty-five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •