Base | Representation |
---|---|
bin | 10011010111111110011… |
… | …001111010101010111101 |
3 | 11201021121110122100002102 |
4 | 103113332121322222331 |
5 | 133303213223214440 |
6 | 2455350455234445 |
7 | 165122441430053 |
oct | 23277631725275 |
9 | 4637543570072 |
10 | 1331413101245 |
11 | 473715a93097 |
12 | 196053678a25 |
13 | 98723177306 |
14 | 486255561d3 |
15 | 24976b30b15 |
hex | 135fe67aabd |
1331413101245 has 4 divisors (see below), whose sum is σ = 1597695721500. Its totient is φ = 1065130480992.
The previous prime is 1331413101241. The next prime is 1331413101247. The reversal of 1331413101245 is 5421013141331.
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 875373556996 + 456039544249 = 935614^2 + 675307^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331413101245 - 22 = 1331413101241 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331413101241) 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, 133141310120 + ... + 133141310129.
It is an arithmetic number, because the mean of its divisors is an integer number (399423930375).
Almost surely, 21331413101245 is an apocalyptic number.
It is an amenable number.
1331413101245 is a deficient number, since it is larger than the sum of its proper divisors (266282620255).
1331413101245 is an equidigital number, since it uses as much as digits as its factorization.
1331413101245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266282620254.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 1331413101245 its reverse (5421013141331), we get a palindrome (6752426242576).
The spelling of 1331413101245 in words is "one trillion, three hundred thirty-one billion, four hundred thirteen million, one hundred one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •