Base | Representation |
---|---|
bin | 1101100011010… |
… | …11010110010000 |
3 | 21220220211202001 |
4 | 12301223112100 |
5 | 213100422104 |
6 | 15140403344 |
7 | 2550212533 |
oct | 661532620 |
9 | 256824661 |
10 | 113685904 |
11 | 591999a2 |
12 | 320a6554 |
13 | 1a725c87 |
14 | 11154a1a |
15 | 9ea9aa4 |
hex | 6c6b590 |
113685904 has 20 divisors (see below), whose sum is σ = 226220764. Its totient is φ = 55306368.
The previous prime is 113685899. The next prime is 113685931. The reversal of 113685904 is 409586311.
It can be written as a sum of positive squares in 2 ways, for example, as 61152400 + 52533504 = 7820^2 + 7248^2 .
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95427 + ... + 96610.
Almost surely, 2113685904 is an apocalyptic number.
It is an amenable number.
113685904 is a deficient number, since it is larger than the sum of its proper divisors (112534860).
113685904 is a wasteful number, since it uses less digits than its factorization.
113685904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192082 (or 192076 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 113685904 is about 10662.3592136075. The cubic root of 113685904 is about 484.4350299461.
The spelling of 113685904 in words is "one hundred thirteen million, six hundred eighty-five thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •