Base | Representation |
---|---|
bin | 110100111011111001… |
… | …1001101101110001011 |
3 | 101212102111012210022202 |
4 | 1221313303031232023 |
5 | 3330303320021242 |
6 | 124120132510415 |
7 | 11133034046261 |
oct | 1516763155613 |
9 | 355374183282 |
10 | 113679063947 |
11 | 44235960329 |
12 | 1a046a7b40b |
13 | a9487a0317 |
14 | 5705a74431 |
15 | 2e550c5932 |
hex | 1a77ccdb8b |
113679063947 has 16 divisors (see below), whose sum is σ = 118037831040. Its totient is φ = 109420301952.
The previous prime is 113679063943. The next prime is 113679063997. The reversal of 113679063947 is 749360976311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 113679063947 - 22 = 113679063943 is a prime.
It is a super-2 number, since 2×1136790639472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113679063892 and 113679063901.
It is not an unprimeable number, because it can be changed into a prime (113679063943) 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 15 ways as a sum of consecutive naturals, for example, 570893 + ... + 743825.
It is an arithmetic number, because the mean of its divisors is an integer number (7377364440).
Almost surely, 2113679063947 is an apocalyptic number.
113679063947 is a deficient number, since it is larger than the sum of its proper divisors (4358767093).
113679063947 is a wasteful number, since it uses less digits than its factorization.
113679063947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173222.
The product of its (nonzero) digits is 5143824, while the sum is 56.
The spelling of 113679063947 in words is "one hundred thirteen billion, six hundred seventy-nine million, sixty-three thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •