Base | Representation |
---|---|
bin | 10100100000010110… |
… | …00011001100000010 |
3 | 1001102012220110110000 |
4 | 22100023003030002 |
5 | 140021220002323 |
6 | 5020215420430 |
7 | 536543556015 |
oct | 122013031402 |
9 | 31365813400 |
10 | 11008750338 |
11 | 473a175083 |
12 | 2172984716 |
13 | 106599c471 |
14 | 76610b37c |
15 | 44671be43 |
hex | 2902c3302 |
11008750338 has 20 divisors (see below), whose sum is σ = 24667755750. Its totient is φ = 3669583392.
The previous prime is 11008750303. The next prime is 11008750339. The reversal of 11008750338 is 83305780011.
11008750338 is a `hidden beast` number, since 110 + 0 + 8 + 7 + 503 + 38 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9435596769 + 1573153569 = 97137^2 + 39663^2 .
It is a super-2 number, since 2×110087503382 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11008750339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 33977463 + ... + 33977786.
Almost surely, 211008750338 is an apocalyptic number.
11008750338 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11008750338 is an abundant number, since it is smaller than the sum of its proper divisors (13659005412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11008750338 is an equidigital number, since it uses as much as digits as its factorization.
11008750338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67955263 (or 67955254 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The spelling of 11008750338 in words is "eleven billion, eight million, seven hundred fifty thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •