Base | Representation |
---|---|
bin | 110010000000… |
… | …110011100000 |
3 | 220200002012221 |
4 | 302000303200 |
5 | 11324013441 |
6 | 1145000424 |
7 | 216303010 |
oct | 62006340 |
9 | 26602187 |
10 | 13110496 |
11 | 7445123 |
12 | 4483114 |
13 | 29405b9 |
14 | 1a53c40 |
15 | 123e8d1 |
hex | c80ce0 |
13110496 has 48 divisors (see below), whose sum is σ = 29828736. Its totient is φ = 5556096.
The previous prime is 13110491. The next prime is 13110511. The reversal of 13110496 is 69401131.
It is a self number, because there is not a number n which added to its sum of digits gives 13110496.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110491) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23695 + ... + 24241.
It is an arithmetic number, because the mean of its divisors is an integer number (621432).
Almost surely, 213110496 is an apocalyptic number.
13110496 is a gapful number since it is divisible by the number (16) 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 13110496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14914368).
13110496 is an abundant number, since it is smaller than the sum of its proper divisors (16718240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110496 is a wasteful number, since it uses less digits than its factorization.
13110496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 671 (or 663 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 13110496 is about 3620.8418910524. The cubic root of 13110496 is about 235.7977775506.
The spelling of 13110496 in words is "thirteen million, one hundred ten thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •