Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0001101010011010111011 |
3 | 1102222202102011022200020222 |
4 | 2200033322101222122323 |
5 | 2420410441212120401 |
6 | 35230533534210255 |
7 | 2214414404350346 |
oct | 240177221523273 |
9 | 42882364280228 |
10 | 11012200113851 |
11 | 356627a971032 |
12 | 129a2a365398b |
13 | 61b5a4b82931 |
14 | 2a0dc99a545d |
15 | 1416bc7a7c1b |
hex | a03fa46a6bb |
11012200113851 has 2 divisors, whose sum is σ = 11012200113852. Its totient is φ = 11012200113850.
The previous prime is 11012200113793. The next prime is 11012200113911. The reversal of 11012200113851 is 15831100221011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11012200113851 - 210 = 11012200112827 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11012200113851.
It is not a weakly prime, because it can be changed into another prime (11012200113251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506100056925 + 5506100056926.
It is an arithmetic number, because the mean of its divisors is an integer number (5506100056926).
Almost surely, 211012200113851 is an apocalyptic number.
11012200113851 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012200113851 is an equidigital number, since it uses as much as digits as its factorization.
11012200113851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 26.
Adding to 11012200113851 its reverse (15831100221011), we get a palindrome (26843300334862).
The spelling of 11012200113851 in words is "eleven trillion, twelve billion, two hundred million, one hundred thirteen thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •