Base | Representation |
---|---|
bin | 11001101100111110111000… |
… | …100101001000110100111001 |
3 | 112211020202001002220001110122 |
4 | 121230332320211020310321 |
5 | 104304041203244203044 |
6 | 1040230533510023025 |
7 | 32545016406426005 |
oct | 3154767045106471 |
9 | 484222032801418 |
10 | 113042341006649 |
11 | 33022a9554394a |
12 | 10818443347a75 |
13 | 4b0cb01b85842 |
14 | 1dcb3c82a9705 |
15 | d1075620edee |
hex | 66cfb8948d39 |
113042341006649 has 2 divisors, whose sum is σ = 113042341006650. Its totient is φ = 113042341006648.
The previous prime is 113042341006633. The next prime is 113042341006703. The reversal of 113042341006649 is 946600143240311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70317750682624 + 42724590324025 = 8385568^2 + 6536405^2 .
It is a cyclic number.
It is not a de Polignac number, because 113042341006649 - 24 = 113042341006633 is a prime.
It is a super-3 number, since 3×1130423410066493 (a number of 43 digits) contains 333 as substring.
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 (113042341006249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56521170503324 + 56521170503325.
It is an arithmetic number, because the mean of its divisors is an integer number (56521170503325).
Almost surely, 2113042341006649 is an apocalyptic number.
It is an amenable number.
113042341006649 is a deficient number, since it is larger than the sum of its proper divisors (1).
113042341006649 is an equidigital number, since it uses as much as digits as its factorization.
113042341006649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 44.
The spelling of 113042341006649 in words is "one hundred thirteen trillion, forty-two billion, three hundred forty-one million, six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •