Base | Representation |
---|---|
bin | 110010001011… |
… | …000110111100 |
3 | 220202020010001 |
4 | 302023012330 |
5 | 11331341300 |
6 | 1145524044 |
7 | 216540031 |
oct | 62130674 |
9 | 26666101 |
10 | 13152700 |
11 | 7473900 |
12 | 44a3624 |
13 | 2956882 |
14 | 1a65388 |
15 | 124c16a |
hex | c8b1bc |
13152700 has 54 divisors (see below), whose sum is σ = 31400768. Its totient is φ = 4778400.
The previous prime is 13152697. The next prime is 13152707. The reversal of 13152700 is 725131.
13152700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13152707) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11557 + ... + 12643.
Almost surely, 213152700 is an apocalyptic number.
13152700 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 13152700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15700384).
13152700 is an abundant number, since it is smaller than the sum of its proper divisors (18248068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13152700 is a wasteful number, since it uses less digits than its factorization.
13152700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123 (or 1105 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 19.
The square root of 13152700 is about 3626.6651348036. The cubic root of 13152700 is about 236.0505254266.
Adding to 13152700 its reverse (725131), we get a palindrome (13877831).
The spelling of 13152700 in words is "thirteen million, one hundred fifty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •