Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …010010110111110010111 |
3 | 10220011210211121111211011 |
4 | 100000221002112332113 |
5 | 121011202212041043 |
6 | 2201231442353051 |
7 | 142325661436345 |
oct | 20005102267627 |
9 | 3804724544734 |
10 | 1100200112023 |
11 | 394657310131 |
12 | 15928695b787 |
13 | 7c9963a155c |
14 | 3b36dcb8995 |
15 | 1d94332d59d |
hex | 10029096f97 |
1100200112023 has 2 divisors, whose sum is σ = 1100200112024. Its totient is φ = 1100200112022.
The previous prime is 1100200111963. The next prime is 1100200112051. The reversal of 1100200112023 is 3202110020011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100200112023 - 213 = 1100200103831 is a prime.
It is a super-3 number, since 3×11002001120233 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100200111994 and 1100200112012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100200112923) 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, 550100056011 + 550100056012.
It is an arithmetic number, because the mean of its divisors is an integer number (550100056012).
Almost surely, 21100200112023 is an apocalyptic number.
1100200112023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100200112023 is an equidigital number, since it uses as much as digits as its factorization.
1100200112023 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 13.
Adding to 1100200112023 its reverse (3202110020011), we get a palindrome (4302310132034).
The spelling of 1100200112023 in words is "one trillion, one hundred billion, two hundred million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •