Base | Representation |
---|---|
bin | 10101100111000011… |
… | …00110000000001100 |
3 | 1002221112221200121100 |
4 | 22303201212000030 |
5 | 142230034101133 |
6 | 5155124103100 |
7 | 560335130334 |
oct | 126341460014 |
9 | 32845850540 |
10 | 11601862668 |
11 | 4a13a49160 |
12 | 22b9534a90 |
13 | 112b825cc6 |
14 | 7c0bc00c4 |
15 | 47d828e13 |
hex | 2b386600c |
11601862668 has 36 divisors (see below), whose sum is σ = 31993016328. Its totient is φ = 3515715840.
The previous prime is 11601862667. The next prime is 11601862691. The reversal of 11601862668 is 86626810611.
11601862668 is a `hidden beast` number, since 1 + 1 + 6 + 0 + 18 + 626 + 6 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (11601862667) 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 11 ways as a sum of consecutive naturals, for example, 14648421 + ... + 14649212.
It is an arithmetic number, because the mean of its divisors is an integer number (888694898).
Almost surely, 211601862668 is an apocalyptic number.
11601862668 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11601862668 is an abundant number, since it is smaller than the sum of its proper divisors (20391153660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11601862668 is a wasteful number, since it uses less digits than its factorization.
11601862668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29297654 (or 29297649 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The spelling of 11601862668 in words is "eleven billion, six hundred one million, eight hundred sixty-two thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •