Base | Representation |
---|---|
bin | 110000110111… |
… | …110011011000 |
3 | 220002220001021 |
4 | 300313303120 |
5 | 11234431410 |
6 | 1134332224 |
7 | 213616153 |
oct | 60676330 |
9 | 26086037 |
10 | 12811480 |
11 | 7260500 |
12 | 435a074 |
13 | 2867476 |
14 | 19b6c9a |
15 | 11d0eda |
hex | c37cd8 |
12811480 has 48 divisors (see below), whose sum is σ = 31696560. Its totient is φ = 4656960.
The previous prime is 12811471. The next prime is 12811481. The reversal of 12811480 is 8411821.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12811481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3517 + ... + 6163.
It is an arithmetic number, because the mean of its divisors is an integer number (660345).
Almost surely, 212811480 is an apocalyptic number.
12811480 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 12811480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15848280).
12811480 is an abundant number, since it is smaller than the sum of its proper divisors (18885080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12811480 is a wasteful number, since it uses less digits than its factorization.
12811480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2680 (or 2665 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 25.
The square root of 12811480 is about 3579.3127832029. The cubic root of 12811480 is about 233.9913309180.
The spelling of 12811480 in words is "twelve million, eight hundred eleven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.338 sec. • engine limits •