Base | Representation |
---|---|
bin | 10011010111101101000… |
… | …000000010010010010101 |
3 | 11201020212010012100012102 |
4 | 103113231000002102111 |
5 | 133302114000312041 |
6 | 2455301504531445 |
7 | 165112264461152 |
oct | 23275500022225 |
9 | 4636763170172 |
10 | 1331121104021 |
11 | 473586185275 |
12 | 195b91920b85 |
13 | 986a781bca7 |
14 | 485d8867229 |
15 | 2495b1a309b |
hex | 135ed002495 |
1331121104021 has 16 divisors (see below), whose sum is σ = 1411519737600. Its totient is φ = 1250956424448.
The previous prime is 1331121104017. The next prime is 1331121104039. The reversal of 1331121104021 is 1204011211331.
It is a cyclic number.
It is not a de Polignac number, because 1331121104021 - 22 = 1331121104017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1331121103984 and 1331121104002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331121104041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56227175 + ... + 56250843.
It is an arithmetic number, because the mean of its divisors is an integer number (88219983600).
Almost surely, 21331121104021 is an apocalyptic number.
It is an amenable number.
1331121104021 is a deficient number, since it is larger than the sum of its proper divisors (80398633579).
1331121104021 is a wasteful number, since it uses less digits than its factorization.
1331121104021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28468.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1331121104021 its reverse (1204011211331), we get a palindrome (2535132315352).
The spelling of 1331121104021 in words is "one trillion, three hundred thirty-one billion, one hundred twenty-one million, one hundred four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •