Base | Representation |
---|---|
bin | 10000001100101111111… |
… | …001011000001011001001 |
3 | 10221102100211101022211212 |
4 | 100030233321120023021 |
5 | 121214313211200131 |
6 | 2211221433302505 |
7 | 143266064504141 |
oct | 20145771301311 |
9 | 3842324338755 |
10 | 1113200100041 |
11 | 39a118487587 |
12 | 15b8b4564a35 |
13 | 80c8876a963 |
14 | 3bc4463d921 |
15 | 1de5477ba2b |
hex | 1032fe582c9 |
1113200100041 has 2 divisors, whose sum is σ = 1113200100042. Its totient is φ = 1113200100040.
The previous prime is 1113200099969. The next prime is 1113200100139. The reversal of 1113200100041 is 1400010023111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1102019152441 + 11180947600 = 1049771^2 + 105740^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113200100041 - 214 = 1113200083657 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113200099989 and 1113200100025.
It is not a weakly prime, because it can be changed into another prime (1113200100941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556600050020 + 556600050021.
It is an arithmetic number, because the mean of its divisors is an integer number (556600050021).
Almost surely, 21113200100041 is an apocalyptic number.
It is an amenable number.
1113200100041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113200100041 is an equidigital number, since it uses as much as digits as its factorization.
1113200100041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1113200100041 its reverse (1400010023111), we get a palindrome (2513210123152).
The spelling of 1113200100041 in words is "one trillion, one hundred thirteen billion, two hundred million, one hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •