Base | Representation |
---|---|
bin | 10011010111111110010… |
… | …011000110000101110101 |
3 | 11201021121100021111002121 |
4 | 103113332103012011311 |
5 | 133303212244004023 |
6 | 2455350353035541 |
7 | 165122420301415 |
oct | 23277623060565 |
9 | 4637540244077 |
10 | 1331411313013 |
11 | 473714a81611 |
12 | 196052b55bb1 |
13 | 9872299c3a2 |
14 | 4862520c645 |
15 | 249768cad5d |
hex | 135fe4c6175 |
1331411313013 has 8 divisors (see below), whose sum is σ = 1362406785696. Its totient is φ = 1300417314000.
The previous prime is 1331411312963. The next prime is 1331411313041. The reversal of 1331411313013 is 3103131141331.
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 1331411313013 - 29 = 1331411312501 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 (1331411313073) 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, 1577838 + ... + 2269888.
It is an arithmetic number, because the mean of its divisors is an integer number (170300848212).
Almost surely, 21331411313013 is an apocalyptic number.
It is an amenable number.
1331411313013 is a deficient number, since it is larger than the sum of its proper divisors (30995472683).
1331411313013 is an equidigital number, since it uses as much as digits as its factorization.
1331411313013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736835.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 1331411313013 its reverse (3103131141331), we get a palindrome (4434542454344).
The spelling of 1331411313013 in words is "one trillion, three hundred thirty-one billion, four hundred eleven million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •