Base | Representation |
---|---|
bin | 11101011111011110011… |
… | …11100000011001011001 |
3 | 10120212120210022012110021 |
4 | 32233233033200121121 |
5 | 113100300232242131 |
6 | 2053303510550441 |
7 | 133132201344022 |
oct | 16575717403131 |
9 | 3525523265407 |
10 | 1013331134041 |
11 | 36082a00a246 |
12 | 144482668421 |
13 | 74731149535 |
14 | 3708cb6bc49 |
15 | 1b55bcc6e11 |
hex | ebef3e0659 |
1013331134041 has 2 divisors, whose sum is σ = 1013331134042. Its totient is φ = 1013331134040.
The previous prime is 1013331134029. The next prime is 1013331134059. The reversal of 1013331134041 is 1404311333101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 962527777225 + 50803356816 = 981085^2 + 225396^2 .
It is an emirp because it is prime and its reverse (1404311333101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1013331134041 - 25 = 1013331134009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013331133997 and 1013331134015.
It is not a weakly prime, because it can be changed into another prime (1013331131041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506665567020 + 506665567021.
It is an arithmetic number, because the mean of its divisors is an integer number (506665567021).
Almost surely, 21013331134041 is an apocalyptic number.
It is an amenable number.
1013331134041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013331134041 is an equidigital number, since it uses as much as digits as its factorization.
1013331134041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 1013331134041 its reverse (1404311333101), we get a palindrome (2417642467142).
The spelling of 1013331134041 in words is "one trillion, thirteen billion, three hundred thirty-one million, one hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •