Base | Representation |
---|---|
bin | 10011000101000100110… |
… | …111001000110111100101 |
3 | 11122100020020012202111010 |
4 | 103011010313020313211 |
5 | 132440133301031323 |
6 | 2442153110532433 |
7 | 163503532632231 |
oct | 23050467106745 |
9 | 4570206182433 |
10 | 1311120330213 |
11 | 466052277941 |
12 | 19212b667119 |
13 | 9683ac330a5 |
14 | 4765c41d5c1 |
15 | 2418a332c93 |
hex | 13144dc8de5 |
1311120330213 has 8 divisors (see below), whose sum is σ = 1748169671776. Its totient is φ = 874075604400.
The previous prime is 1311120330203. The next prime is 1311120330217. The reversal of 1311120330213 is 3120330211131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1311120330213 - 229 = 1310583459301 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 1311120330213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311120330217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 425443 + ... + 1674288.
It is an arithmetic number, because the mean of its divisors is an integer number (218521208972).
Almost surely, 21311120330213 is an apocalyptic number.
It is an amenable number.
1311120330213 is a deficient number, since it is larger than the sum of its proper divisors (437049341563).
1311120330213 is a wasteful number, since it uses less digits than its factorization.
1311120330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2307875.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1311120330213 its reverse (3120330211131), we get a palindrome (4431450541344).
The spelling of 1311120330213 in words is "one trillion, three hundred eleven billion, one hundred twenty million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •