Base | Representation |
---|---|
bin | 10100100110001111… |
… | …01001100101001100 |
3 | 1001112122221021211100 |
4 | 22103013221211030 |
5 | 140121344100133 |
6 | 5025143223100 |
7 | 541014032640 |
oct | 122307514514 |
9 | 31478837740 |
10 | 11058190668 |
11 | 4765073358 |
12 | 2187447a90 |
13 | 1072cbcbb5 |
14 | 76c8dac20 |
15 | 44ac35e13 |
hex | 2931e994c |
11058190668 has 144 divisors (see below), whose sum is σ = 34916603904. Its totient is φ = 2877672960.
The previous prime is 11058190667. The next prime is 11058190697. The reversal of 11058190668 is 86609185011.
11058190668 is a `hidden beast` number, since 1 + 1 + 0 + 581 + 9 + 0 + 6 + 68 = 666.
It is not an unprimeable number, because it can be changed into a prime (11058190667) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 91171 + ... + 174437.
It is an arithmetic number, because the mean of its divisors is an integer number (242476416).
Almost surely, 211058190668 is an apocalyptic number.
11058190668 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11058190668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17458301952).
11058190668 is an abundant number, since it is smaller than the sum of its proper divisors (23858413236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11058190668 is a wasteful number, since it uses less digits than its factorization.
11058190668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83332 (or 83327 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 45.
The spelling of 11058190668 in words is "eleven billion, fifty-eight million, one hundred ninety thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •