Base | Representation |
---|---|
bin | 1101011111101… |
… | …01100001010001 |
3 | 21220000022201010 |
4 | 12233311201101 |
5 | 212440001111 |
6 | 15122201133 |
7 | 2543132502 |
oct | 657654121 |
9 | 256008633 |
10 | 113203281 |
11 | 5899a334 |
12 | 31ab31a9 |
13 | 1a5b73b9 |
14 | 1106aba9 |
15 | 9e11aa6 |
hex | 6bf5851 |
113203281 has 4 divisors (see below), whose sum is σ = 150937712. Its totient is φ = 75468852.
The previous prime is 113203271. The next prime is 113203303. The reversal of 113203281 is 182302311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 182302311 = 3 ⋅60767437.
It is not a de Polignac number, because 113203281 - 214 = 113186897 is a prime.
It is a super-2 number, since 2×1132032812 = 25629965658329922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113203231) 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, 18867211 + ... + 18867216.
It is an arithmetic number, because the mean of its divisors is an integer number (37734428).
Almost surely, 2113203281 is an apocalyptic number.
It is an amenable number.
113203281 is a deficient number, since it is larger than the sum of its proper divisors (37734431).
113203281 is an equidigital number, since it uses as much as digits as its factorization.
113203281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37734430.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 113203281 is about 10639.7030503675. The cubic root of 113203281 is about 483.7485446210.
Adding to 113203281 its reverse (182302311), we get a palindrome (295505592).
The spelling of 113203281 in words is "one hundred thirteen million, two hundred three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •