Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …110111111110000010001 |
3 | 10220011021220001211011022 |
4 | 100000131012333300101 |
5 | 121010300000013131 |
6 | 2201155533325225 |
7 | 142321011510404 |
oct | 20003506776021 |
9 | 3804256054138 |
10 | 1100000001041 |
11 | 394564361857 |
12 | 15922b936815 |
13 | 7c963aa88a6 |
14 | 3b3514a7d3b |
15 | 1d9309a137b |
hex | 1001d1bfc11 |
1100000001041 has 2 divisors, whose sum is σ = 1100000001042. Its totient is φ = 1100000001040.
The previous prime is 1100000001013. The next prime is 1100000001071. The reversal of 1100000001041 is 1401000000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 702244000000 + 397756001041 = 838000^2 + 630679^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100000001041 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100000001071) 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 as a sum of consecutive naturals, namely, 550000000520 + 550000000521.
It is an arithmetic number, because the mean of its divisors is an integer number (550000000521).
Almost surely, 21100000001041 is an apocalyptic number.
It is an amenable number.
1100000001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100000001041 is an equidigital number, since it uses as much as digits as its factorization.
1100000001041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1100000001041 its reverse (1401000000011), we get a palindrome (2501000001052).
The spelling of 1100000001041 in words is "one trillion, one hundred billion, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •