Base | Representation |
---|---|
bin | 10100110110001001… |
… | …11010010010000000 |
3 | 1001212222010202222200 |
4 | 22123010322102000 |
5 | 140410033042433 |
6 | 5050312433200 |
7 | 544224540615 |
oct | 123304722200 |
9 | 31788122880 |
10 | 11191690368 |
11 | 4823465691 |
12 | 22040a8800 |
13 | 10948625c1 |
14 | 78252c50c |
15 | 457806613 |
hex | 29b13a480 |
11191690368 has 48 divisors (see below), whose sum is σ = 32205258150. Its totient is φ = 3730563072.
The previous prime is 11191690361. The next prime is 11191690373. The reversal of 11191690368 is 86309619111.
11191690368 is a `hidden beast` number, since 11 + 191 + 6 + 90 + 368 = 666.
It can be written as a sum of positive squares in only one way, i.e., 6568778304 + 4622912064 = 81048^2 + 67992^2 .
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (11191690361) 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 5 ways as a sum of consecutive naturals, for example, 4856353 + ... + 4858656.
Almost surely, 211191690368 is an apocalyptic number.
11191690368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11191690368 is an abundant number, since it is smaller than the sum of its proper divisors (21013567782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11191690368 is an equidigital number, since it uses as much as digits as its factorization.
11191690368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9715029 (or 9715014 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 45.
The spelling of 11191690368 in words is "eleven billion, one hundred ninety-one million, six hundred ninety thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •