Base | Representation |
---|---|
bin | 10011010111111001100… |
… | …001100010001011100101 |
3 | 11201021101202112221011121 |
4 | 103113321201202023211 |
5 | 133303031242241010 |
6 | 2455334412133541 |
7 | 165120425404654 |
oct | 23277141421345 |
9 | 4637352487147 |
10 | 1331331212005 |
11 | 473683841533 |
12 | 1960301672b1 |
13 | 9870c205042 |
14 | 4861871b19b |
15 | 2496e8573da |
hex | 135f98622e5 |
1331331212005 has 8 divisors (see below), whose sum is σ = 1597608098424. Its totient is φ = 1065057873600.
The previous prime is 1331331211993. The next prime is 1331331212129. The reversal of 1331331212005 is 5002121331331.
It can be written as a sum of positive squares in 4 ways, for example, as 36289488004 + 1295041724001 = 190498^2 + 1137999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1331331212005 - 29 = 1331331211493 is a prime.
It is a super-2 number, since 2×13313312120052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23475 + ... + 1631935.
It is an arithmetic number, because the mean of its divisors is an integer number (199701012303).
Almost surely, 21331331212005 is an apocalyptic number.
It is an amenable number.
1331331212005 is a deficient number, since it is larger than the sum of its proper divisors (266276886419).
1331331212005 is a wasteful number, since it uses less digits than its factorization.
1331331212005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1774007.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 1331331212005 its reverse (5002121331331), we get a palindrome (6333452543336).
The spelling of 1331331212005 in words is "one trillion, three hundred thirty-one billion, three hundred thirty-one million, two hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •