Base | Representation |
---|---|
bin | 1101011111111… |
… | …10100000111001 |
3 | 21220002012020120 |
4 | 12233332200321 |
5 | 212442140441 |
6 | 15123043453 |
7 | 2543345061 |
oct | 657764071 |
9 | 256065216 |
10 | 113240121 |
11 | 58a14a85 |
12 | 31b10589 |
13 | 1a5cb0b7 |
14 | 1107a3a1 |
15 | 9e1c966 |
hex | 6bfe839 |
113240121 has 4 divisors (see below), whose sum is σ = 150986832. Its totient is φ = 75493412.
The previous prime is 113240119. The next prime is 113240143. The reversal of 113240121 is 121042311.
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.
It is a cyclic number.
It is not a de Polignac number, because 113240121 - 21 = 113240119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113240121.
It is not an unprimeable number, because it can be changed into a prime (113240161) 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 3 ways as a sum of consecutive naturals, for example, 18873351 + ... + 18873356.
It is an arithmetic number, because the mean of its divisors is an integer number (37746708).
Almost surely, 2113240121 is an apocalyptic number.
It is an amenable number.
113240121 is a deficient number, since it is larger than the sum of its proper divisors (37746711).
113240121 is an equidigital number, since it uses as much as digits as its factorization.
113240121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37746710.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 113240121 is about 10641.4341608638. The cubic root of 113240121 is about 483.8010147243.
Adding to 113240121 its reverse (121042311), we get a palindrome (234282432).
The spelling of 113240121 in words is "one hundred thirteen million, two hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •