Base | Representation |
---|---|
bin | 11000011010111110… |
… | …10000100100011011 |
3 | 1020211202000222020000 |
4 | 30031133100210123 |
5 | 203322431400102 |
6 | 10005002304043 |
7 | 642623234652 |
oct | 141537204433 |
9 | 36752028200 |
10 | 13111200027 |
11 | 5618a26702 |
12 | 265aab8023 |
13 | 130c437333 |
14 | 8c5434199 |
15 | 51b0ba01c |
hex | 30d7d091b |
13111200027 has 10 divisors (see below), whose sum is σ = 19585866828. Its totient is φ = 8740799964.
The previous prime is 13111200013. The next prime is 13111200029. The reversal of 13111200027 is 72000211131.
It is a happy number.
13111200027 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 13111200027 - 218 = 13110937883 is a prime.
It is a super-2 number, since 2×131112000272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13111199982 and 13111200009.
It is not an unprimeable number, because it can be changed into a prime (13111200029) 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 9 ways as a sum of consecutive naturals, for example, 80933253 + ... + 80933414.
Almost surely, 213111200027 is an apocalyptic number.
13111200027 is a deficient number, since it is larger than the sum of its proper divisors (6474666801).
13111200027 is an equidigital number, since it uses as much as digits as its factorization.
13111200027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161866679 (or 161866670 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
Adding to 13111200027 its reverse (72000211131), we get a palindrome (85111411158).
The spelling of 13111200027 in words is "thirteen billion, one hundred eleven million, two hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •