Base | Representation |
---|---|
bin | 1100000001001110100000… |
… | …0001111101110111000011 |
3 | 1201210100202212021200012202 |
4 | 3000103220001331313003 |
5 | 3213004223312412011 |
6 | 44034552405343415 |
7 | 2532524164366400 |
oct | 300235001756703 |
9 | 51710685250182 |
10 | 13215212232131 |
11 | 42355a3870068 |
12 | 1595243a07b6b |
13 | 74b25c7a1480 |
14 | 3398965b52a7 |
15 | 17db5839423b |
hex | c04e807ddc3 |
13215212232131 has 48 divisors (see below), whose sum is σ = 16649475192000. Its totient is φ = 10396595607552.
The previous prime is 13215212232107. The next prime is 13215212232181. The reversal of 13215212232131 is 13123221251231.
It is a de Polignac number, because none of the positive numbers 2k-13215212232131 is a prime.
It is a super-2 number, since 2×132152122321312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13215212232094 and 13215212232103.
It is not an unprimeable number, because it can be changed into a prime (13215212232181) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 196829375 + ... + 196896503.
It is an arithmetic number, because the mean of its divisors is an integer number (346864066500).
Almost surely, 213215212232131 is an apocalyptic number.
13215212232131 is a deficient number, since it is larger than the sum of its proper divisors (3434262959869).
13215212232131 is a wasteful number, since it uses less digits than its factorization.
13215212232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68908 (or 68901 counting only the distinct ones).
The product of its digits is 4320, while the sum is 29.
Adding to 13215212232131 its reverse (13123221251231), we get a palindrome (26338433483362).
The spelling of 13215212232131 in words is "thirteen trillion, two hundred fifteen billion, two hundred twelve million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •