Base | Representation |
---|---|
bin | 11001110001000011100001… |
… | …011110111100000110010101 |
3 | 112212020111101222012010012202 |
4 | 121301003201132330012111 |
5 | 104323132331212343444 |
6 | 1041003300002054245 |
7 | 32604154521600323 |
oct | 3161034136740625 |
9 | 485214358163182 |
10 | 113322200121749 |
11 | 33120747735223 |
12 | 1086272764a385 |
13 | 4b3031207c778 |
14 | 1ddab76530d13 |
15 | d17b855c434e |
hex | 6710e17bc195 |
113322200121749 has 2 divisors, whose sum is σ = 113322200121750. Its totient is φ = 113322200121748.
The previous prime is 113322200121737. The next prime is 113322200121799. The reversal of 113322200121749 is 947121002223311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107005990696900 + 6316209424849 = 10344370^2 + 2513207^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113322200121749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113322200121799) 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, 56661100060874 + 56661100060875.
It is an arithmetic number, because the mean of its divisors is an integer number (56661100060875).
Almost surely, 2113322200121749 is an apocalyptic number.
It is an amenable number.
113322200121749 is a deficient number, since it is larger than the sum of its proper divisors (1).
113322200121749 is an equidigital number, since it uses as much as digits as its factorization.
113322200121749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 38.
The spelling of 113322200121749 in words is "one hundred thirteen trillion, three hundred twenty-two billion, two hundred million, one hundred twenty-one thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •