Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …001111110000110010011 |
3 | 10220011210211102100001101 |
4 | 100000221001332012103 |
5 | 121011202200311011 |
6 | 2201231440245231 |
7 | 142325660533315 |
oct | 20005101760623 |
9 | 3804724370041 |
10 | 1100200010131 |
11 | 394657250622 |
12 | 159286910817 |
13 | 7c996367071 |
14 | 3b36dc8d7b5 |
15 | 1d94330d2c1 |
hex | 1002907e193 |
1100200010131 has 2 divisors, whose sum is σ = 1100200010132. Its totient is φ = 1100200010130.
The previous prime is 1100200010089. The next prime is 1100200010177. The reversal of 1100200010131 is 1310100020011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100200010131 - 27 = 1100200010003 is a prime.
It is a super-2 number, since 2×11002000101312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100200080131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550100005065 + 550100005066.
It is an arithmetic number, because the mean of its divisors is an integer number (550100005066).
Almost surely, 21100200010131 is an apocalyptic number.
1100200010131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100200010131 is an equidigital number, since it uses as much as digits as its factorization.
1100200010131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1100200010131 its reverse (1310100020011), we get a palindrome (2410300030142).
The spelling of 1100200010131 in words is "one trillion, one hundred billion, two hundred million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •