Base | Representation |
---|---|
bin | 10100011111110010… |
… | …10110101000010010 |
3 | 1001101220011202222200 |
4 | 22033321112220102 |
5 | 140014023031003 |
6 | 5015532144030 |
7 | 536456255241 |
oct | 121771265022 |
9 | 31356152880 |
10 | 11004111378 |
11 | 4737596827 |
12 | 2171308016 |
13 | 1064a36b10 |
14 | 765660958 |
15 | 4461026a3 |
hex | 28fe56a12 |
11004111378 has 48 divisors (see below), whose sum is σ = 25776308376. Its totient is φ = 3372687360.
The previous prime is 11004111253. The next prime is 11004111403. The reversal of 11004111378 is 87311140011.
11004111378 is a `hidden beast` number, since 110 + 0 + 411 + 137 + 8 = 666.
11004111378 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 8132973489 + 2871137889 = 90183^2 + 53583^2 .
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 23 ways as a sum of consecutive naturals, for example, 31353 + ... + 151628.
Almost surely, 211004111378 is an apocalyptic number.
11004111378 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11004111378 is an abundant number, since it is smaller than the sum of its proper divisors (14772196998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11004111378 is a wasteful number, since it uses less digits than its factorization.
11004111378 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183259 (or 183256 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
Adding to 11004111378 its reverse (87311140011), we get a palindrome (98315251389).
The spelling of 11004111378 in words is "eleven billion, four million, one hundred eleven thousand, three hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •