Base | Representation |
---|---|
bin | 10011010111111001000… |
… | …011011001010011010001 |
3 | 11201021101012200112110101 |
4 | 103113321003121103101 |
5 | 133303022231430223 |
6 | 2455333530532401 |
7 | 165120301300612 |
oct | 23277103312321 |
9 | 4637335615411 |
10 | 1331323311313 |
11 | 47367a335636 |
12 | 196029597101 |
13 | 9870a699b88 |
14 | 48617661c09 |
15 | 2496dce64ad |
hex | 135f90d94d1 |
1331323311313 has 8 divisors (see below), whose sum is σ = 1400145573888. Its totient is φ = 1263412602144.
The previous prime is 1331323311293. The next prime is 1331323311319. The reversal of 1331323311313 is 3131133231331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331323311313 is a prime.
It is a super-2 number, since 2×13313233113132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331323311319) 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, 227885356 + ... + 227891197.
It is an arithmetic number, because the mean of its divisors is an integer number (175018196736).
Almost surely, 21331323311313 is an apocalyptic number.
It is an amenable number.
1331323311313 is a deficient number, since it is larger than the sum of its proper divisors (68822262575).
1331323311313 is a wasteful number, since it uses less digits than its factorization.
1331323311313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455776703.
The product of its digits is 4374, while the sum is 28.
Adding to 1331323311313 its reverse (3131133231331), we get a palindrome (4462456542644).
The spelling of 1331323311313 in words is "one trillion, three hundred thirty-one billion, three hundred twenty-three million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •