Base | Representation |
---|---|
bin | 110000101011… |
… | …100000000000 |
3 | 220000022220220 |
4 | 300223200000 |
5 | 11231323323 |
6 | 1133303040 |
7 | 213316224 |
oct | 60534000 |
9 | 26008826 |
10 | 12761088 |
11 | 722665a |
12 | 4334a80 |
13 | 284a552 |
14 | 19a2784 |
15 | 11c10e3 |
hex | c2b800 |
12761088 has 96 divisors (see below), whose sum is σ = 35642880. Its totient is φ = 4055040.
The previous prime is 12761083. The next prime is 12761123. The reversal of 12761088 is 88016721.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12761081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 190431 + ... + 190497.
It is an arithmetic number, because the mean of its divisors is an integer number (371280).
Almost surely, 212761088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12761088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17821440).
12761088 is an abundant number, since it is smaller than the sum of its proper divisors (22881792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12761088 is an equidigital number, since it uses as much as digits as its factorization.
12761088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123 (or 103 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 33.
The square root of 12761088 is about 3572.2665074151. The cubic root of 12761088 is about 233.6841380783.
The spelling of 12761088 in words is "twelve million, seven hundred sixty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •