Base | Representation |
---|---|
bin | 1101100010000… |
… | …10110110100011 |
3 | 21220121102012202 |
4 | 12301002312203 |
5 | 213030120120 |
6 | 15133043415 |
7 | 2545622126 |
oct | 661026643 |
9 | 256542182 |
10 | 113520035 |
11 | 59096312 |
12 | 3202656b |
13 | 1a698625 |
14 | 111103bd |
15 | 9e75875 |
hex | 6c42da3 |
113520035 has 4 divisors (see below), whose sum is σ = 136224048. Its totient is φ = 90816024.
The previous prime is 113520031. The next prime is 113520097. The reversal of 113520035 is 530025311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 530025311 = 19 ⋅27896069.
It is a cyclic number.
It is not a de Polignac number, because 113520035 - 22 = 113520031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113519989 and 113520016.
It is not an unprimeable number, because it can be changed into a prime (113520031) by changing a digit.
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, 11351999 + ... + 11352008.
It is an arithmetic number, because the mean of its divisors is an integer number (34056012).
Almost surely, 2113520035 is an apocalyptic number.
113520035 is a deficient number, since it is larger than the sum of its proper divisors (22704013).
113520035 is an equidigital number, since it uses as much as digits as its factorization.
113520035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22704012.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 113520035 is about 10654.5781239803. The cubic root of 113520035 is about 484.1993165715.
Adding to 113520035 its reverse (530025311), we get a palindrome (643545346).
The spelling of 113520035 in words is "one hundred thirteen million, five hundred twenty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •