Base | Representation |
---|---|
bin | 10011011000000011101… |
… | …101000101101011010101 |
3 | 11201021211122221112021121 |
4 | 103120003231011223111 |
5 | 133303404003410031 |
6 | 2455403353043541 |
7 | 165124601241316 |
oct | 23300355055325 |
9 | 4637748845247 |
10 | 1331502013141 |
11 | 4737611a09a3 |
12 | 1960793b65b1 |
13 | 98738707bc1 |
14 | 4863329c60d |
15 | 2497e845011 |
hex | 13603b45ad5 |
1331502013141 has 8 divisors (see below), whose sum is σ = 1343045287904. Its totient is φ = 1319999891760.
The previous prime is 1331502013139. The next prime is 1331502013159. The reversal of 1331502013141 is 1413102051331.
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 1331502013141 - 21 = 1331502013139 is a prime.
It is a super-2 number, since 2×13315020131412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331502083141) 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, 10223355 + ... + 10352776.
It is an arithmetic number, because the mean of its divisors is an integer number (167880660988).
Almost surely, 21331502013141 is an apocalyptic number.
It is an amenable number.
1331502013141 is a deficient number, since it is larger than the sum of its proper divisors (11543274763).
1331502013141 is a wasteful number, since it uses less digits than its factorization.
1331502013141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20576691.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 1331502013141 its reverse (1413102051331), we get a palindrome (2744604064472).
The spelling of 1331502013141 in words is "one trillion, three hundred thirty-one billion, five hundred two million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •