Base | Representation |
---|---|
bin | 1010010011011111100010… |
… | …1000000001010001101111 |
3 | 1111010010201011212121120202 |
4 | 2210313320220001101233 |
5 | 2441112320000000421 |
6 | 40032532524504115 |
7 | 2246364650665112 |
oct | 244677050012157 |
9 | 44103634777522 |
10 | 11330000000111 |
11 | 367903169a331 |
12 | 132b9b60ab03b |
13 | 642550617b00 |
14 | 2b2536b22579 |
15 | 149abc99210b |
hex | a4df8a0146f |
11330000000111 has 12 divisors (see below), whose sum is σ = 12801996402768. Its totient is φ = 10003745816064.
The previous prime is 11330000000107. The next prime is 11330000000117. The reversal of 11330000000111 is 11100000003311.
It is a happy number.
It is not a de Polignac number, because 11330000000111 - 22 = 11330000000107 is a prime.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 11330000000092 and 11330000000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330000000117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1457418290 + ... + 1457426063.
It is an arithmetic number, because the mean of its divisors is an integer number (1066833033564).
Almost surely, 211330000000111 is an apocalyptic number.
11330000000111 is a deficient number, since it is larger than the sum of its proper divisors (1471996402657).
11330000000111 is a wasteful number, since it uses less digits than its factorization.
11330000000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2914844402 (or 2914844389 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 11330000000111 its reverse (11100000003311), we get a palindrome (22430000003422).
The spelling of 11330000000111 in words is "eleven trillion, three hundred thirty billion, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •