Base | Representation |
---|---|
bin | 11001011011011100… |
… | …11010000110011100 |
3 | 1022020102201121010101 |
4 | 30231232122012130 |
5 | 210424410322030 |
6 | 10134402350444 |
7 | 662211305062 |
oct | 145556320634 |
9 | 38212647111 |
10 | 13652042140 |
11 | 5876249360 |
12 | 279005b424 |
13 | 13974bc359 |
14 | 9371bc032 |
15 | 54d7ee7ca |
hex | 32db9a19c |
13652042140 has 48 divisors (see below), whose sum is σ = 31671521280. Its totient is φ = 4901532480.
The previous prime is 13652042123. The next prime is 13652042147. The reversal of 13652042140 is 4124025631.
It is a super-3 number, since 3×136520421403 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13652042099 and 13652042108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13652042147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 375372 + ... + 410131.
It is an arithmetic number, because the mean of its divisors is an integer number (659823360).
Almost surely, 213652042140 is an apocalyptic number.
13652042140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13652042140 is an abundant number, since it is smaller than the sum of its proper divisors (18019479140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13652042140 is a wasteful number, since it uses less digits than its factorization.
13652042140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785602 (or 785600 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 13652042140 its reverse (4124025631), we get a palindrome (17776067771).
The spelling of 13652042140 in words is "thirteen billion, six hundred fifty-two million, forty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •