Base | Representation |
---|---|
bin | 10011010111111110110… |
… | …101110011000010111001 |
3 | 11201021121222101122212120 |
4 | 103113332311303002321 |
5 | 133303222111110131 |
6 | 2455351320031453 |
7 | 165122560520361 |
oct | 23277665630271 |
9 | 4637558348776 |
10 | 1331420410041 |
11 | 47371a125317 |
12 | 196056002589 |
13 | 98724835c47 |
14 | 486264d99a1 |
15 | 249775c6496 |
hex | 135fed730b9 |
1331420410041 has 4 divisors (see below), whose sum is σ = 1775227213392. Its totient is φ = 887613606692.
The previous prime is 1331420410031. The next prime is 1331420410049. The reversal of 1331420410041 is 1400140241331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1331420410041 - 225 = 1331386855609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1331420409993 and 1331420410020.
It is not an unprimeable number, because it can be changed into a prime (1331420410049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221903401671 + ... + 221903401676.
It is an arithmetic number, because the mean of its divisors is an integer number (443806803348).
Almost surely, 21331420410041 is an apocalyptic number.
It is an amenable number.
1331420410041 is a deficient number, since it is larger than the sum of its proper divisors (443806803351).
1331420410041 is an equidigital number, since it uses as much as digits as its factorization.
1331420410041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443806803350.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1331420410041 its reverse (1400140241331), we get a palindrome (2731560651372).
The spelling of 1331420410041 in words is "one trillion, three hundred thirty-one billion, four hundred twenty million, four hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •