Base | Representation |
---|---|
bin | 10011010111111000111… |
… | …011011101001111101001 |
3 | 11201021101001202210212022 |
4 | 103113320323131033221 |
5 | 133303021213332223 |
6 | 2455333414154225 |
7 | 165120244512554 |
oct | 23277073351751 |
9 | 4637331683768 |
10 | 1331321230313 |
11 | 4736791440a8 |
12 | 196028952975 |
13 | 9870a11b909 |
14 | 4861727d69b |
15 | 2496da34ac8 |
hex | 135f8edd3e9 |
1331321230313 has 4 divisors (see below), whose sum is σ = 1331326012740. Its totient is φ = 1331316447888.
The previous prime is 1331321230307. The next prime is 1331321230331. The reversal of 1331321230313 is 3130321231331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 678470158249 + 652851072064 = 823693^2 + 807992^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331321230313 - 224 = 1331304453097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331321230913) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1946018 + ... + 2539611.
It is an arithmetic number, because the mean of its divisors is an integer number (332831503185).
Almost surely, 21331321230313 is an apocalyptic number.
It is an amenable number.
1331321230313 is a deficient number, since it is larger than the sum of its proper divisors (4782427).
1331321230313 is an equidigital number, since it uses as much as digits as its factorization.
1331321230313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4782426.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1331321230313 its reverse (3130321231331), we get a palindrome (4461642461644).
The spelling of 1331321230313 in words is "one trillion, three hundred thirty-one billion, three hundred twenty-one million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •