Base | Representation |
---|---|
bin | 11000100111000000… |
… | …10010101011110111 |
3 | 1021002202221221210022 |
4 | 30103200102223313 |
5 | 204024301243020 |
6 | 10023005515355 |
7 | 645260200334 |
oct | 142340225367 |
9 | 37082857708 |
10 | 13212134135 |
11 | 566a9a5a22 |
12 | 2688872b5b |
13 | 1327317065 |
14 | 8d49c998b |
15 | 524da6625 |
hex | 313812af7 |
13212134135 has 4 divisors (see below), whose sum is σ = 15854560968. Its totient is φ = 10569707304.
The previous prime is 13212134129. The next prime is 13212134183. The reversal of 13212134135 is 53143121231.
13212134135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53143121231 = 4421 ⋅12020611.
It is a cyclic number.
It is not a de Polignac number, because 13212134135 - 26 = 13212134071 is a prime.
It is a Duffinian number.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 1321213409 + ... + 1321213418.
It is an arithmetic number, because the mean of its divisors is an integer number (3963640242).
Almost surely, 213212134135 is an apocalyptic number.
13212134135 is a deficient number, since it is larger than the sum of its proper divisors (2642426833).
13212134135 is an equidigital number, since it uses as much as digits as its factorization.
13212134135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2642426832.
The product of its digits is 2160, while the sum is 26.
Adding to 13212134135 its reverse (53143121231), we get a palindrome (66355255366).
The spelling of 13212134135 in words is "thirteen billion, two hundred twelve million, one hundred thirty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •