Base | Representation |
---|---|
bin | 11001011010001010… |
… | …10000010010011000 |
3 | 1022012200102111122010 |
4 | 30231011100102120 |
5 | 210414130112130 |
6 | 10133335225520 |
7 | 662020513641 |
oct | 145505202230 |
9 | 38180374563 |
10 | 13641254040 |
11 | 5870150077 |
12 | 27885182a0 |
13 | 13951b2b6b |
14 | 9359b06c8 |
15 | 54c8bd0b0 |
hex | 32d150498 |
13641254040 has 64 divisors (see below), whose sum is σ = 40951928160. Its totient is φ = 3635164160.
The previous prime is 13641254027. The next prime is 13641254047. The reversal of 13641254040 is 4045214631.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 13641253989 and 13641254007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13641254047) 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 15 ways as a sum of consecutive naturals, for example, 139342 + ... + 216098.
Almost surely, 213641254040 is an apocalyptic number.
13641254040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13641254040 is an abundant number, since it is smaller than the sum of its proper divisors (27310674120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13641254040 is a wasteful number, since it uses less digits than its factorization.
13641254040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78252 (or 78248 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 13641254040 its reverse (4045214631), we get a palindrome (17686468671).
The spelling of 13641254040 in words is "thirteen billion, six hundred forty-one million, two hundred fifty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •