Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110010111100101000101 |
3 | 1102222112222210120220010222 |
4 | 2200031331012113211011 |
5 | 2420342141100013333 |
6 | 35225545313354125 |
7 | 2214311353603544 |
oct | 240157506274505 |
9 | 42875883526128 |
10 | 11010100001093 |
11 | 35653a2466256 |
12 | 12999b8268945 |
13 | 61b32ba5566b |
14 | 2a0c6aaca15b |
15 | 1415e821c298 |
hex | a037d197945 |
11010100001093 has 2 divisors, whose sum is σ = 11010100001094. Its totient is φ = 11010100001092.
The previous prime is 11010100001059. The next prime is 11010100001099. The reversal of 11010100001093 is 39010000101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10656196370689 + 353903630404 = 3264383^2 + 594898^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010100001093 - 216 = 11010099935557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010100001099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505050000546 + 5505050000547.
It is an arithmetic number, because the mean of its divisors is an integer number (5505050000547).
Almost surely, 211010100001093 is an apocalyptic number.
It is an amenable number.
11010100001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010100001093 is an equidigital number, since it uses as much as digits as its factorization.
11010100001093 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 17.
The spelling of 11010100001093 in words is "eleven trillion, ten billion, one hundred million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •