Base | Representation |
---|---|
bin | 11001001011101110… |
… | …01000111000000000 |
3 | 1021220020110220120120 |
4 | 30211313020320000 |
5 | 210142122110102 |
6 | 10113330540240 |
7 | 656020031340 |
oct | 144567107000 |
9 | 37806426516 |
10 | 13520113152 |
11 | 580882a137 |
12 | 2753a37680 |
13 | 1376079870 |
14 | 923878d20 |
15 | 541e3e6bc |
hex | 325dc8e00 |
13520113152 has 320 divisors, whose sum is σ = 44646142464. Its totient is φ = 3540418560.
The previous prime is 13520113097. The next prime is 13520113163. The reversal of 13520113152 is 25131102531.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27535627 + ... + 27536117.
Almost surely, 213520113152 is an apocalyptic number.
13520113152 is a gapful number since it is divisible by the number (12) 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 13520113152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22323071232).
13520113152 is an abundant number, since it is smaller than the sum of its proper divisors (31126029312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13520113152 is a wasteful number, since it uses less digits than its factorization.
13520113152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729 (or 713 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 13520113152 its reverse (25131102531), we get a palindrome (38651215683).
The spelling of 13520113152 in words is "thirteen billion, five hundred twenty million, one hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •