Base | Representation |
---|---|
bin | 10110100010011111… |
… | …00000111111001011 |
3 | 1011020022010001010212 |
4 | 23101033200333023 |
5 | 144240203040021 |
6 | 5320414231335 |
7 | 605601020522 |
oct | 132117407713 |
9 | 34208101125 |
10 | 12100440011 |
11 | 514a423750 |
12 | 24184b554b |
13 | 11aac0069a |
14 | 82b0c54b9 |
15 | 4ac4b085b |
hex | 2d13e0fcb |
12100440011 has 4 divisors (see below), whose sum is σ = 13200480024. Its totient is φ = 11000400000.
The previous prime is 12100440007. The next prime is 12100440019. The reversal of 12100440011 is 11004400121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12100440011 - 22 = 12100440007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100440019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550019990 + ... + 550020011.
It is an arithmetic number, because the mean of its divisors is an integer number (3300120006).
Almost surely, 212100440011 is an apocalyptic number.
12100440011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12100440011 is a deficient number, since it is larger than the sum of its proper divisors (1100040013).
12100440011 is a wasteful number, since it uses less digits than its factorization.
12100440011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1100040012.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12100440011 its reverse (11004400121), we get a palindrome (23104840132).
It can be divided in two parts, 1 and 2100440011, that added together give a palindrome (2100440012).
The spelling of 12100440011 in words is "twelve billion, one hundred million, four hundred forty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •