Base | Representation |
---|---|
bin | 10000000101001101000… |
… | …101111111001000111001 |
3 | 10220122110022122010021112 |
4 | 100011031011333020321 |
5 | 121101221100310131 |
6 | 2203402000250105 |
7 | 142561260045326 |
oct | 20051505771071 |
9 | 3818408563245 |
10 | 1105100010041 |
11 | 396741167025 |
12 | 15a213910935 |
13 | 802975820b1 |
14 | 3b6b695db4d |
15 | 1db2d5b002b |
hex | 1014d17f239 |
1105100010041 has 2 divisors, whose sum is σ = 1105100010042. Its totient is φ = 1105100010040.
The previous prime is 1105100010017. The next prime is 1105100010083. The reversal of 1105100010041 is 1400100015011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 811882092025 + 293217918016 = 901045^2 + 541496^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105100010041 - 222 = 1105095815737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1105100009998 and 1105100010025.
It is not a weakly prime, because it can be changed into another prime (1105100018041) 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, 552550005020 + 552550005021.
It is an arithmetic number, because the mean of its divisors is an integer number (552550005021).
Almost surely, 21105100010041 is an apocalyptic number.
It is an amenable number.
1105100010041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105100010041 is an equidigital number, since it uses as much as digits as its factorization.
1105100010041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 1105100010041 its reverse (1400100015011), we get a palindrome (2505200025052).
The spelling of 1105100010041 in words is "one trillion, one hundred five billion, one hundred million, ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •