Base | Representation |
---|---|
bin | 110001110110… |
… | …000011010100 |
3 | 220120211210200 |
4 | 301312003110 |
5 | 11321111302 |
6 | 1144020500 |
7 | 216030420 |
oct | 61660324 |
9 | 26524720 |
10 | 13066452 |
11 | 7415023 |
12 | 4461730 |
13 | 2926539 |
14 | 1a41b80 |
15 | 123181c |
hex | c760d4 |
13066452 has 72 divisors (see below), whose sum is σ = 39748800. Its totient is φ = 3535488.
The previous prime is 13066451. The next prime is 13066457. The reversal of 13066452 is 25466031.
13066452 is a `hidden beast` number, since 13 + 0 + 6 + 645 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13066451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3424 + ... + 6152.
Almost surely, 213066452 is an apocalyptic number.
13066452 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 13066452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19874400).
13066452 is an abundant number, since it is smaller than the sum of its proper divisors (26682348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13066452 is a wasteful number, since it uses less digits than its factorization.
13066452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2765 (or 2760 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 13066452 is about 3614.7547634660. The cubic root of 13066452 is about 235.5334313635.
The spelling of 13066452 in words is "thirteen million, sixty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •