Base | Representation |
---|---|
bin | 11001101101111000111001… |
… | …010011111001110100101001 |
3 | 112211110200211011011121000001 |
4 | 121231320321103321310221 |
5 | 104311101240323314003 |
6 | 1040315314433343001 |
7 | 32552353114550212 |
oct | 3155707123716451 |
9 | 484420734147001 |
10 | 113104630291753 |
11 | 3304744a193771 |
12 | 10828527a07a61 |
13 | 4b1594a9a5aa9 |
14 | 1dd0416bdc409 |
15 | d1219e91961d |
hex | 66de394f9d29 |
113104630291753 has 4 divisors (see below), whose sum is σ = 113125982879700. Its totient is φ = 113083277703808.
The previous prime is 113104630291733. The next prime is 113104630291759. The reversal of 113104630291753 is 357192036401311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 49987770461209 + 63116859830544 = 7070203^2 + 7944612^2 .
It is a cyclic number.
It is not a de Polignac number, because 113104630291753 - 29 = 113104630291241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113104630291759) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10676286028 + ... + 10676296621.
It is an arithmetic number, because the mean of its divisors is an integer number (28281495719925).
Almost surely, 2113104630291753 is an apocalyptic number.
It is an amenable number.
113104630291753 is a deficient number, since it is larger than the sum of its proper divisors (21352587947).
113104630291753 is an equidigital number, since it uses as much as digits as its factorization.
113104630291753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21352587946.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 113104630291753 in words is "one hundred thirteen trillion, one hundred four billion, six hundred thirty million, two hundred ninety-one thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •