Base | Representation |
---|---|
bin | 110001110001… |
… | …110011101000 |
3 | 220112221221200 |
4 | 301301303220 |
5 | 11320032224 |
6 | 1143404200 |
7 | 215625630 |
oct | 61616350 |
9 | 26487850 |
10 | 13049064 |
11 | 7402a56 |
12 | 4453660 |
13 | 291b652 |
14 | 1a396c0 |
15 | 122b5c9 |
hex | c71ce8 |
13049064 has 96 divisors (see below), whose sum is σ = 42793920. Its totient is φ = 3506688.
The previous prime is 13049053. The next prime is 13049093. The reversal of 13049064 is 46094031.
13049064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7807 + ... + 9329.
It is an arithmetic number, because the mean of its divisors is an integer number (445770).
Almost surely, 213049064 is an apocalyptic number.
13049064 is a gapful number since it is divisible by the number (14) 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 13049064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21396960).
13049064 is an abundant number, since it is smaller than the sum of its proper divisors (29744856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13049064 is a wasteful number, since it uses less digits than its factorization.
13049064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1559 (or 1552 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 13049064 is about 3612.3488203661. The cubic root of 13049064 is about 235.4289073682.
It can be divided in two parts, 130 and 49064, that added together give a palindrome (49194).
The spelling of 13049064 in words is "thirteen million, forty-nine thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •