Base | Representation |
---|---|
bin | 11000100110111001… |
… | …10010001011000111 |
3 | 1021002201020020100001 |
4 | 30103130302023013 |
5 | 204024032331120 |
6 | 10022534102131 |
7 | 645246320311 |
oct | 142334621307 |
9 | 37081206301 |
10 | 13211214535 |
11 | 566a428022 |
12 | 26884aa947 |
13 | 132708460c |
14 | 8d482a7b1 |
15 | 524c73e0a |
hex | 3137322c7 |
13211214535 has 8 divisors (see below), whose sum is σ = 15855562800. Its totient is φ = 10567568064.
The previous prime is 13211214517. The next prime is 13211214553. The reversal of 13211214535 is 53541211231.
13211214535 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13211214517) and next prime (13211214553).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13211214535 - 223 = 13202825927 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 133102 + ... + 210091.
It is an arithmetic number, because the mean of its divisors is an integer number (1981945350).
Almost surely, 213211214535 is an apocalyptic number.
13211214535 is a deficient number, since it is larger than the sum of its proper divisors (2644348265).
13211214535 is an equidigital number, since it uses as much as digits as its factorization.
13211214535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350897.
The product of its digits is 3600, while the sum is 28.
Adding to 13211214535 its reverse (53541211231), we get a palindrome (66752425766).
The spelling of 13211214535 in words is "thirteen billion, two hundred eleven million, two hundred fourteen thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •