Base | Representation |
---|---|
bin | 10011010111101101101… |
… | …101110100000100100111 |
3 | 11201020212221210000122202 |
4 | 103113231231310010213 |
5 | 133302130033320143 |
6 | 2455303014045115 |
7 | 165112501461563 |
oct | 23275555640447 |
9 | 4636787700582 |
10 | 1331133104423 |
11 | 473591a31361 |
12 | 195b9594979b |
13 | 986aa161215 |
14 | 485da2ac6a3 |
15 | 2495c273ab8 |
hex | 135edb74127 |
1331133104423 has 4 divisors (see below), whose sum is σ = 1409435051760. Its totient is φ = 1252831157088.
The previous prime is 1331133104417. The next prime is 1331133104443. The reversal of 1331133104423 is 3244013311331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1331133104423 - 212 = 1331133100327 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331133104443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39150973643 + ... + 39150973676.
It is an arithmetic number, because the mean of its divisors is an integer number (352358762940).
Almost surely, 21331133104423 is an apocalyptic number.
1331133104423 is a deficient number, since it is larger than the sum of its proper divisors (78301947337).
1331133104423 is an equidigital number, since it uses as much as digits as its factorization.
1331133104423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78301947336.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 1331133104423 its reverse (3244013311331), we get a palindrome (4575146415754).
The spelling of 1331133104423 in words is "one trillion, three hundred thirty-one billion, one hundred thirty-three million, one hundred four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •