Base | Representation |
---|---|
bin | 1101011111000… |
… | …11101011110111 |
3 | 21212212121111120 |
4 | 12233203223313 |
5 | 212430131411 |
6 | 15120435023 |
7 | 2542406514 |
oct | 657435367 |
9 | 255777446 |
10 | 113130231 |
11 | 5894a465 |
12 | 31a78a73 |
13 | 1a590086 |
14 | 1104c30b |
15 | 9dea106 |
hex | 6be3af7 |
113130231 has 8 divisors (see below), whose sum is σ = 151622640. Its totient is φ = 75028992.
The previous prime is 113130229. The next prime is 113130263. The reversal of 113130231 is 132031311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113130231 - 21 = 113130229 is a prime.
It is a super-2 number, since 2×1131302312 = 25596898332226722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113130231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113130211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97116 + ... + 98273.
It is an arithmetic number, because the mean of its divisors is an integer number (18952830).
Almost surely, 2113130231 is an apocalyptic number.
113130231 is a deficient number, since it is larger than the sum of its proper divisors (38492409).
113130231 is a wasteful number, since it uses less digits than its factorization.
113130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195585.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 113130231 is about 10636.2695998174. The cubic root of 113130231 is about 483.6444680290.
Adding to 113130231 its reverse (132031311), we get a palindrome (245161542).
The spelling of 113130231 in words is "one hundred thirteen million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •