Base | Representation |
---|---|
bin | 10101011011001110… |
… | …01100110001010001 |
3 | 1002200122022010022101 |
4 | 22231213030301101 |
5 | 142024140401011 |
6 | 5141222040401 |
7 | 555022033534 |
oct | 125547146121 |
9 | 32618263271 |
10 | 11502668881 |
11 | 4972a58420 |
12 | 2290279101 |
13 | 1114105462 |
14 | 7b195ca1b |
15 | 474c832c1 |
hex | 2ad9ccc51 |
11502668881 has 16 divisors (see below), whose sum is σ = 12586654080. Its totient is φ = 10425127680.
The previous prime is 11502668867. The next prime is 11502668893. The reversal of 11502668881 is 18886620511.
11502668881 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11502668881 - 215 = 11502636113 is a prime.
It is a super-2 number, since 2×115026688812 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11502663881) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 8868025 + ... + 8869321.
It is an arithmetic number, because the mean of its divisors is an integer number (786665880).
Almost surely, 211502668881 is an apocalyptic number.
11502668881 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11502668881 is a deficient number, since it is larger than the sum of its proper divisors (1083985199).
11502668881 is a wasteful number, since it uses less digits than its factorization.
11502668881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3144.
The product of its (nonzero) digits is 184320, while the sum is 46.
The spelling of 11502668881 in words is "eleven billion, five hundred two million, six hundred sixty-eight thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •