Base | Representation |
---|---|
bin | 1010101001110000001001… |
… | …0101000000000110101110 |
3 | 1112110200210022221010101110 |
4 | 2222130002111000012232 |
5 | 3013344011202013303 |
6 | 40524335322452450 |
7 | 2316123362544000 |
oct | 252340225000656 |
9 | 45420708833343 |
10 | 11712414876078 |
11 | 3806230945774 |
12 | 1391b40064126 |
13 | 66c6259751c7 |
14 | 2c6c53612370 |
15 | 154a00633703 |
hex | aa7025401ae |
11712414876078 has 128 divisors (see below), whose sum is σ = 27839635200000. Its totient is φ = 3282483300096.
The previous prime is 11712414875999. The next prime is 11712414876137. The reversal of 11712414876078 is 87067841421711.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 578409298 + ... + 578429546.
It is an arithmetic number, because the mean of its divisors is an integer number (217497150000).
Almost surely, 211712414876078 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11712414876078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13919817600000).
11712414876078 is an abundant number, since it is smaller than the sum of its proper divisors (16127220323922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11712414876078 is a wasteful number, since it uses less digits than its factorization.
11712414876078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25631 (or 25617 counting only the distinct ones).
The product of its (nonzero) digits is 4214784, while the sum is 57.
The spelling of 11712414876078 in words is "eleven trillion, seven hundred twelve billion, four hundred fourteen million, eight hundred seventy-six thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •