Base | Representation |
---|---|
bin | 10011000100111111011… |
… | …111000100000111011101 |
3 | 11122022222221111021110111 |
4 | 103010333133010013131 |
5 | 132434442203230323 |
6 | 2442140125410021 |
7 | 163501356156223 |
oct | 23047737040735 |
9 | 4568887437414 |
10 | 1311030133213 |
11 | 466006371569 |
12 | 192105409911 |
13 | 96825342598 |
14 | 47650460b13 |
15 | 24182467c0d |
hex | 1313f7c41dd |
1311030133213 has 8 divisors (see below), whose sum is σ = 1322538459840. Its totient is φ = 1299558991200.
The previous prime is 1311030133211. The next prime is 1311030133229. The reversal of 1311030133213 is 3123310301131.
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 1311030133213 - 21 = 1311030133211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311030133211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9225328 + ... + 9366361.
It is an arithmetic number, because the mean of its divisors is an integer number (165317307480).
Almost surely, 21311030133213 is an apocalyptic number.
It is an amenable number.
1311030133213 is a deficient number, since it is larger than the sum of its proper divisors (11508326627).
1311030133213 is a wasteful number, since it uses less digits than its factorization.
1311030133213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18592307.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1311030133213 its reverse (3123310301131), we get a palindrome (4434340434344).
The spelling of 1311030133213 in words is "one trillion, three hundred eleven billion, thirty million, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •