Base | Representation |
---|---|
bin | 11001001110001001… |
… | …00100111001110000 |
3 | 1021221122200020210021 |
4 | 30213010210321300 |
5 | 210212321204130 |
6 | 10115334013224 |
7 | 656354416600 |
oct | 144704447160 |
9 | 37848606707 |
10 | 13540413040 |
11 | 5819234800 |
12 | 275a7a7214 |
13 | 137a33662b |
14 | 926440c00 |
15 | 543aee37a |
hex | 327124e70 |
13540413040 has 180 divisors, whose sum is σ = 40254564168. Its totient is φ = 4220240640.
The previous prime is 13540412983. The next prime is 13540413041. The reversal of 13540413040 is 4031404531.
It is a junction number, because it is equal to n+sod(n) for n = 13540412996 and 13540413014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13540413041) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 460047 + ... + 488593.
Almost surely, 213540413040 is an apocalyptic number.
13540413040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13540413040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20127282084).
13540413040 is an abundant number, since it is smaller than the sum of its proper divisors (26714151128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13540413040 is a wasteful number, since it uses less digits than its factorization.
13540413040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28596 (or 28572 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 13540413040 its reverse (4031404531), we get a palindrome (17571817571).
The spelling of 13540413040 in words is "thirteen billion, five hundred forty million, four hundred thirteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •