Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001001110000111000000101 |
3 | 111020222011121111020122110002 |
4 | 112333031233021300320011 |
5 | 101222420023100323023 |
6 | 555005112033211045 |
7 | 30203212335620054 |
oct | 2677155711607005 |
9 | 436864544218402 |
10 | 101101100011013 |
11 | 2a23981028a783 |
12 | b40a0a1a00a85 |
13 | 4454a3caa6bbb |
14 | 1ad746841c39b |
15 | ba4d11b09b28 |
hex | 5bf36f270e05 |
101101100011013 has 2 divisors, whose sum is σ = 101101100011014. Its totient is φ = 101101100011012.
The previous prime is 101101100010979. The next prime is 101101100011039. The reversal of 101101100011013 is 310110001101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59342402373604 + 41758697637409 = 7703402^2 + 6462097^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101100011013 - 246 = 30732355833349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101101100010985 and 101101100011003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101101100019013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550550005506 + 50550550005507.
It is an arithmetic number, because the mean of its divisors is an integer number (50550550005507).
Almost surely, 2101101100011013 is an apocalyptic number.
It is an amenable number.
101101100011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101100011013 is an equidigital number, since it uses as much as digits as its factorization.
101101100011013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 101101100011013 its reverse (310110001101101), we get a palindrome (411211101112114).
The spelling of 101101100011013 in words is "one hundred one trillion, one hundred one billion, one hundred million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •