Base | Representation |
---|---|
bin | 11001110100011000010111… |
… | …001110101101010001100001 |
3 | 112220001100021222002001021022 |
4 | 121310120113032231101201 |
5 | 104340403401141244243 |
6 | 1041300253151535225 |
7 | 32626525033101602 |
oct | 3164302716552141 |
9 | 486040258061238 |
10 | 113550735103073 |
11 | 331a9661782214 |
12 | 1089aa8752a515 |
13 | 4b48a3309bb78 |
14 | 2007c56261da9 |
15 | d1daadc37b68 |
hex | 6746173ad461 |
113550735103073 has 2 divisors, whose sum is σ = 113550735103074. Its totient is φ = 113550735103072.
The previous prime is 113550735102913. The next prime is 113550735103087. The reversal of 113550735103073 is 370301537055311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71212197767824 + 42338537335249 = 8438732^2 + 6506807^2 .
It is a cyclic number.
It is not a de Polignac number, because 113550735103073 - 224 = 113550718325857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (113550735108073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56775367551536 + 56775367551537.
It is an arithmetic number, because the mean of its divisors is an integer number (56775367551537).
Almost surely, 2113550735103073 is an apocalyptic number.
It is an amenable number.
113550735103073 is a deficient number, since it is larger than the sum of its proper divisors (1).
113550735103073 is an equidigital number, since it uses as much as digits as its factorization.
113550735103073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 496125, while the sum is 44.
The spelling of 113550735103073 in words is "one hundred thirteen trillion, five hundred fifty billion, seven hundred thirty-five million, one hundred three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •