Base | Representation |
---|---|
bin | 110100111010010101… |
… | …1011111011011001101 |
3 | 101212021211200211000001 |
4 | 1221310223133123031 |
5 | 3330201414121121 |
6 | 124111022404301 |
7 | 11131530036115 |
oct | 1516453373315 |
9 | 355254624001 |
10 | 113626707661 |
11 | 44209350275 |
12 | 1a031430691 |
13 | a93a99b57c |
14 | 56dcb26045 |
15 | 2e506d2991 |
hex | 1a74adf6cd |
113626707661 has 4 divisors (see below), whose sum is σ = 113632036992. Its totient is φ = 113621378332.
The previous prime is 113626707637. The next prime is 113626707749. The reversal of 113626707661 is 166707626311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113626707661 - 27 = 113626707533 is a prime.
It is a super-2 number, since 2×1136267076612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113626707461) 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 in 3 ways as a sum of consecutive naturals, for example, 2632555 + ... + 2675368.
It is an arithmetic number, because the mean of its divisors is an integer number (28408009248).
Almost surely, 2113626707661 is an apocalyptic number.
It is an amenable number.
113626707661 is a deficient number, since it is larger than the sum of its proper divisors (5329331).
113626707661 is an equidigital number, since it uses as much as digits as its factorization.
113626707661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5329330.
The product of its (nonzero) digits is 381024, while the sum is 46.
The spelling of 113626707661 in words is "one hundred thirteen billion, six hundred twenty-six million, seven hundred seven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •