Base | Representation |
---|---|
bin | 1101011110011… |
… | …11111101111101 |
3 | 21212201111201101 |
4 | 12233033331331 |
5 | 212420040334 |
6 | 15115013101 |
7 | 2541622201 |
oct | 657177575 |
9 | 255644641 |
10 | 113049469 |
11 | 588a4815 |
12 | 31a3a191 |
13 | 1a5623a0 |
14 | 1102ab01 |
15 | 9dd1214 |
hex | 6bcff7d |
113049469 has 4 divisors (see below), whose sum is σ = 121745596. Its totient is φ = 104353344.
The previous prime is 113049457. The next prime is 113049493. The reversal of 113049469 is 964940311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 964940311 = 1601 ⋅602711.
It can be written as a sum of positive squares in 2 ways, for example, as 39312900 + 73736569 = 6270^2 + 8587^2 .
It is a cyclic number.
It is not a de Polignac number, because 113049469 - 217 = 112918397 is a prime.
It is a super-2 number, since 2×1130494692 = 25560364882363922, which 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 (113049169) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4348044 + ... + 4348069.
It is an arithmetic number, because the mean of its divisors is an integer number (30436399).
Almost surely, 2113049469 is an apocalyptic number.
It is an amenable number.
113049469 is a deficient number, since it is larger than the sum of its proper divisors (8696127).
113049469 is an equidigital number, since it uses as much as digits as its factorization.
113049469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8696126.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 113049469 is about 10632.4723841635. The cubic root of 113049469 is about 483.5293517520.
The spelling of 113049469 in words is "one hundred thirteen million, forty-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •