Base | Representation |
---|---|
bin | 10011010111111001100… |
… | …100101000011110110001 |
3 | 11201021101211002012100102 |
4 | 103113321210220132301 |
5 | 133303031444233431 |
6 | 2455334441402145 |
7 | 165120435330002 |
oct | 23277144503661 |
9 | 4637354065312 |
10 | 1331332024241 |
11 | 4736842467aa |
12 | 196030499355 |
13 | 9870c42a95b |
14 | 4861888d1a9 |
15 | 2496e967dcb |
hex | 135f99287b1 |
1331332024241 has 8 divisors (see below), whose sum is σ = 1421140190400. Its totient is φ = 1243497664080.
The previous prime is 1331332024223. The next prime is 1331332024271. The reversal of 1331332024241 is 1424202331331.
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-1331332024241 is a prime.
It is a super-2 number, since 2×13313320242412 (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 (1331332024271) 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, 493450106 + ... + 493452803.
It is an arithmetic number, because the mean of its divisors is an integer number (177642523800).
Almost surely, 21331332024241 is an apocalyptic number.
It is an amenable number.
1331332024241 is a deficient number, since it is larger than the sum of its proper divisors (89808166159).
1331332024241 is an equidigital number, since it uses as much as digits as its factorization.
1331332024241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 986902999.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1331332024241 its reverse (1424202331331), we get a palindrome (2755534355572).
The spelling of 1331332024241 in words is "one trillion, three hundred thirty-one billion, three hundred thirty-two million, twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •