Base | Representation |
---|---|
bin | 11000011010111101… |
… | …00010011100101000 |
3 | 1020211201200101002011 |
4 | 30031132202130220 |
5 | 203322404323422 |
6 | 10004554245304 |
7 | 642621520123 |
oct | 141536423450 |
9 | 36751611064 |
10 | 13111011112 |
11 | 5618907781 |
12 | 265aa26834 |
13 | 130c39c354 |
14 | 8c53c53ba |
15 | 51b07e077 |
hex | 30d7a2728 |
13111011112 has 32 divisors (see below), whose sum is σ = 24684004800. Its totient is φ = 6528649600.
The previous prime is 13111011073. The next prime is 13111011127. The reversal of 13111011112 is 21111011131.
It is a super-2 number, since 2×131110111122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13111011092 and 13111011101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4802964 + ... + 4805692.
It is an arithmetic number, because the mean of its divisors is an integer number (771375150).
Almost surely, 213111011112 is an apocalyptic number.
It is an amenable number.
13111011112 is a deficient number, since it is larger than the sum of its proper divisors (11572993688).
13111011112 is a wasteful number, since it uses less digits than its factorization.
13111011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4977 (or 4973 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 13111011112 its reverse (21111011131), we get a palindrome (34222022243).
The spelling of 13111011112 in words is "thirteen billion, one hundred eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •