Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001101111010111111011111 |
3 | 111020222011121120022000122211 |
4 | 112333031233031322333133 |
5 | 101222420023340213043 |
6 | 555005112112421251 |
7 | 30203212351106662 |
oct | 2677155715727737 |
9 | 436864546260584 |
10 | 101101101101023 |
11 | 2a239810964711 |
12 | b40a0a2247827 |
13 | 4454a4009908a |
14 | 1ad74686236d9 |
15 | ba4d11c72a9d |
hex | 5bf36f37afdf |
101101101101023 has 2 divisors, whose sum is σ = 101101101101024. Its totient is φ = 101101101101022.
The previous prime is 101101101100999. The next prime is 101101101101053. The reversal of 101101101101023 is 320101101101101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101101101101023 - 217 = 101101100969951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101101100994 and 101101101101012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101101101053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550550550511 + 50550550550512.
It is an arithmetic number, because the mean of its divisors is an integer number (50550550550512).
Almost surely, 2101101101101023 is an apocalyptic number.
101101101101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101101101023 is an equidigital number, since it uses as much as digits as its factorization.
101101101101023 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 13.
Adding to 101101101101023 its reverse (320101101101101), we get a palindrome (421202202202124).
The spelling of 101101101101023 in words is "one hundred one trillion, one hundred one billion, one hundred one million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •