Base | Representation |
---|---|
bin | 110010001010… |
… | …000101110100 |
3 | 220202000101200 |
4 | 302022011310 |
5 | 11331223112 |
6 | 1145452500 |
7 | 216521625 |
oct | 62120564 |
9 | 26660350 |
10 | 13148532 |
11 | 7470761 |
12 | 44a1130 |
13 | 29549c7 |
14 | 1a63a4c |
15 | 124acdc |
hex | c8a174 |
13148532 has 72 divisors (see below), whose sum is σ = 35817600. Its totient is φ = 4053888.
The previous prime is 13148507. The next prime is 13148533. The reversal of 13148532 is 23584131.
It is a happy number.
Its product of digits (2880) is a multiple of the sum of its prime divisors (480).
It is a junction number, because it is equal to n+sod(n) for n = 13148496 and 13148505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13148533) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31944 + ... + 32352.
Almost surely, 213148532 is an apocalyptic number.
13148532 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 13148532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17908800).
13148532 is an abundant number, since it is smaller than the sum of its proper divisors (22669068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13148532 is a wasteful number, since it uses less digits than its factorization.
13148532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485 (or 480 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 13148532 is about 3626.0904566764. The cubic root of 13148532 is about 236.0255885306.
The spelling of 13148532 in words is "thirteen million, one hundred forty-eight thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •