Base | Representation |
---|---|
bin | 10000000101001101011… |
… | …101000010111101100101 |
3 | 10220122110202000020102101 |
4 | 100011031131002331211 |
5 | 121101224122230023 |
6 | 2203402334012101 |
7 | 142561362323212 |
oct | 20051535027545 |
9 | 3818422006371 |
10 | 1105106055013 |
11 | 396744615774 |
12 | 15a215947031 |
13 | 802988ba6bc |
14 | 3b6b7694b09 |
15 | 1db2dda61ad |
hex | 1014d742f65 |
1105106055013 has 2 divisors, whose sum is σ = 1105106055014. Its totient is φ = 1105106055012.
The previous prime is 1105106054999. The next prime is 1105106055089. The reversal of 1105106055013 is 3105506015011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 588400987329 + 516705067684 = 767073^2 + 718822^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105106055013 - 29 = 1105106054501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105106065013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552553027506 + 552553027507.
It is an arithmetic number, because the mean of its divisors is an integer number (552553027507).
Almost surely, 21105106055013 is an apocalyptic number.
It is an amenable number.
1105106055013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105106055013 is an equidigital number, since it uses as much as digits as its factorization.
1105106055013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 28.
The spelling of 1105106055013 in words is "one trillion, one hundred five billion, one hundred six million, fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •