Base | Representation |
---|---|
bin | 11000100111011011… |
… | …00011001100011111 |
3 | 1021010000111112021101 |
4 | 30103231203030133 |
5 | 204031144002011 |
6 | 10023212213531 |
7 | 645331554100 |
oct | 142355431437 |
9 | 37100445241 |
10 | 13215609631 |
11 | 567195a134 |
12 | 2689a6a2a7 |
13 | 1327c62c73 |
14 | 8d52523a7 |
15 | 5253412c1 |
hex | 313b6331f |
13215609631 has 24 divisors (see below), whose sum is σ = 15485452656. Its totient is φ = 11245288320.
The previous prime is 13215609623. The next prime is 13215609647. The reversal of 13215609631 is 13690651231.
It is a happy number.
It is not a de Polignac number, because 13215609631 - 23 = 13215609623 is a prime.
It is a super-2 number, since 2×132156096312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13215609331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4723525 + ... + 4726321.
It is an arithmetic number, because the mean of its divisors is an integer number (645227194).
Almost surely, 213215609631 is an apocalyptic number.
13215609631 is a deficient number, since it is larger than the sum of its proper divisors (2269843025).
13215609631 is a wasteful number, since it uses less digits than its factorization.
13215609631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3479 (or 3472 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 37.
The spelling of 13215609631 in words is "thirteen billion, two hundred fifteen million, six hundred nine thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •