Base | Representation |
---|---|
bin | 11000110100100110… |
… | …00100111111001001 |
3 | 1021101201102120012021 |
4 | 30122103010333021 |
5 | 204242441020130 |
6 | 10042200444441 |
7 | 651143033410 |
oct | 143223047711 |
9 | 37351376167 |
10 | 13326110665 |
11 | 57192731aa |
12 | 26baa79721 |
13 | 1344b123aa |
14 | 905bb8477 |
15 | 52edbc37a |
hex | 31a4c4fc9 |
13326110665 has 32 divisors (see below), whose sum is σ = 18384689664. Its totient is φ = 9083612160.
The previous prime is 13326110627. The next prime is 13326110687. The reversal of 13326110665 is 56601162331.
13326110665 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 13326110665 - 29 = 13326110153 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13326110665.
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 31 ways as a sum of consecutive naturals, for example, 6384252 + ... + 6386338.
It is an arithmetic number, because the mean of its divisors is an integer number (574521552).
Almost surely, 213326110665 is an apocalyptic number.
It is an amenable number.
13326110665 is a deficient number, since it is larger than the sum of its proper divisors (5058578999).
13326110665 is a wasteful number, since it uses less digits than its factorization.
13326110665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3097.
The product of its (nonzero) digits is 19440, while the sum is 34.
Adding to 13326110665 its reverse (56601162331), we get a palindrome (69927272996).
The spelling of 13326110665 in words is "thirteen billion, three hundred twenty-six million, one hundred ten thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.708 sec. • engine limits •