Base | Representation |
---|---|
bin | 1101011111111… |
… | …11011100000100 |
3 | 21220002101102211 |
4 | 12233333130010 |
5 | 212442301113 |
6 | 15123113204 |
7 | 2543362111 |
oct | 657773404 |
9 | 256071384 |
10 | 113243908 |
11 | 58a17908 |
12 | 31b12804 |
13 | 1a5cca3b |
14 | 1107b908 |
15 | 9e1db3d |
hex | 6bff704 |
113243908 has 18 divisors (see below), whose sum is σ = 199725134. Its totient is φ = 56181504.
The previous prime is 113243903. The next prime is 113243909. The reversal of 113243908 is 809342311.
113243908 is digitally balanced in base 9, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 84492864 + 28751044 = 9192^2 + 5362^2 .
It is a super-2 number, since 2×1132439082 = 25648365398224928, which contains 22 as substring.
113243908 is strictly pandigital in base 9.
It is a self number, because there is not a number n which added to its sum of digits gives 113243908.
It is not an unprimeable number, because it can be changed into a prime (113243903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 295485 + ... + 295867.
Almost surely, 2113243908 is an apocalyptic number.
It is an amenable number.
113243908 is a deficient number, since it is larger than the sum of its proper divisors (86481226).
113243908 is an equidigital number, since it uses as much as digits as its factorization.
113243908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 963 (or 578 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 113243908 is about 10641.6120959186. The cubic root of 113243908 is about 483.8064077893.
The spelling of 113243908 in words is "one hundred thirteen million, two hundred forty-three thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •