Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0111101100111111010011 |
3 | 1022210111201001112020002202 |
4 | 2103013223213230333103 |
5 | 2311120300320214024 |
6 | 33300250332433415 |
7 | 2062265333311505 |
oct | 223075347547723 |
9 | 38714631466082 |
10 | 10110011101139 |
11 | 32486a4776624 |
12 | 117347a31886b |
13 | 5844a6a41241 |
14 | 26d4819a1d75 |
15 | 127eb7ecebae |
hex | 931eb9ecfd3 |
10110011101139 has 2 divisors, whose sum is σ = 10110011101140. Its totient is φ = 10110011101138.
The previous prime is 10110011101123. The next prime is 10110011101153. The reversal of 10110011101139 is 93110111001101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10110011101139 - 24 = 10110011101123 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110011101139.
It is not a weakly prime, because it can be changed into another prime (10110011101109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055005550569 + 5055005550570.
It is an arithmetic number, because the mean of its divisors is an integer number (5055005550570).
Almost surely, 210110011101139 is an apocalyptic number.
10110011101139 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110011101139 is an equidigital number, since it uses as much as digits as its factorization.
10110011101139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 10110011101139 in words is "ten trillion, one hundred ten billion, eleven million, one hundred one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •