Base | Representation |
---|---|
bin | 11000011010111001… |
… | …10101110001100100 |
3 | 1020211200211202111002 |
4 | 30031130311301210 |
5 | 203322301102423 |
6 | 10004540532432 |
7 | 642614654312 |
oct | 141534656144 |
9 | 36750752432 |
10 | 13110565988 |
11 | 5618633303 |
12 | 265a851118 |
13 | 130c274870 |
14 | 8c530b0b2 |
15 | 51aee2228 |
hex | 30d735c64 |
13110565988 has 48 divisors (see below), whose sum is σ = 26175777264. Its totient is φ = 5692047360.
The previous prime is 13110565943. The next prime is 13110566003. The reversal of 13110565988 is 88956501131.
13110565988 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 319408384 + 12791157604 = 17872^2 + 113098^2 .
It is a super-2 number, since 2×131105659882 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2685806 + ... + 2690682.
It is an arithmetic number, because the mean of its divisors is an integer number (545328693).
Almost surely, 213110565988 is an apocalyptic number.
It is an amenable number.
13110565988 is a deficient number, since it is larger than the sum of its proper divisors (13065211276).
13110565988 is a wasteful number, since it uses less digits than its factorization.
13110565988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7952 (or 7950 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 47.
The spelling of 13110565988 in words is "thirteen billion, one hundred ten million, five hundred sixty-five thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •