Base | Representation |
---|---|
bin | 110100110010100111… |
… | …0001010100001111101 |
3 | 101211121202200200011122 |
4 | 1221211032022201331 |
5 | 3324134021033121 |
6 | 124025200000325 |
7 | 11122230450251 |
oct | 1514516124175 |
9 | 354552620148 |
10 | 113367361661 |
11 | 44095a13834 |
12 | 19b7a6000a5 |
13 | a8c9035bb8 |
14 | 56b64d6261 |
15 | 2e37a545ab |
hex | 1a6538a87d |
113367361661 has 8 divisors (see below), whose sum is σ = 121680360504. Its totient is φ = 105237066240.
The previous prime is 113367361633. The next prime is 113367361669. The reversal of 113367361661 is 166163763311.
It can be written as a sum of positive squares in 4 ways, for example, as 51622566436 + 61744795225 = 227206^2 + 248485^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113367361661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113367361669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45674570 + ... + 45677051.
It is an arithmetic number, because the mean of its divisors is an integer number (15210045063).
Almost surely, 2113367361661 is an apocalyptic number.
It is an amenable number.
113367361661 is a deficient number, since it is larger than the sum of its proper divisors (8312998843).
113367361661 is an equidigital number, since it uses as much as digits as its factorization.
113367361661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91351711.
The product of its digits is 244944, while the sum is 44.
The spelling of 113367361661 in words is "one hundred thirteen billion, three hundred sixty-seven million, three hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •