Base | Representation |
---|---|
bin | 10110110111010001001100… |
… | …011001010110111110101101 |
3 | 111012000222011202012100222122 |
4 | 112313101030121112332231 |
5 | 101134443223322100333 |
6 | 553510204404122325 |
7 | 30115602012545321 |
oct | 2667211431267655 |
9 | 435028152170878 |
10 | 100555056050093 |
11 | 2a049183747a17 |
12 | b3402b09963a5 |
13 | 44153bb688448 |
14 | 1ab8c68057981 |
15 | b95a03ac1798 |
hex | 5b744c656fad |
100555056050093 has 2 divisors, whose sum is σ = 100555056050094. Its totient is φ = 100555056050092.
The previous prime is 100555056050081. The next prime is 100555056050101. The reversal of 100555056050093 is 390050650555001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62938153289449 + 37616902760644 = 7933357^2 + 6133262^2 .
It is a cyclic number.
It is not a de Polignac number, because 100555056050093 - 214 = 100555056033709 is a prime.
It is a super-2 number, since 2×1005550560500932 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100555056052093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50277528025046 + 50277528025047.
It is an arithmetic number, because the mean of its divisors is an integer number (50277528025047).
Almost surely, 2100555056050093 is an apocalyptic number.
It is an amenable number.
100555056050093 is a deficient number, since it is larger than the sum of its proper divisors (1).
100555056050093 is an equidigital number, since it uses as much as digits as its factorization.
100555056050093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 506250, while the sum is 44.
The spelling of 100555056050093 in words is "one hundred trillion, five hundred fifty-five billion, fifty-six million, fifty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •