Base | Representation |
---|---|
bin | 1101011110010… |
… | …10000001001110 |
3 | 21212200021021220 |
4 | 12233022001032 |
5 | 212413300402 |
6 | 15114304210 |
7 | 2541461151 |
oct | 657120116 |
9 | 255607256 |
10 | 113025102 |
11 | 58888483 |
12 | 31a28066 |
13 | 1a554278 |
14 | 11021c98 |
15 | 9dc8dbc |
hex | 6bca04e |
113025102 has 8 divisors (see below), whose sum is σ = 226050216. Its totient is φ = 37675032.
The previous prime is 113025071. The next prime is 113025103. The reversal of 113025102 is 201520311.
It is a sphenic number, since it is the product of 3 distinct primes.
113025102 is an admirable number.
It is a super-2 number, since 2×1130251022 = 25549347364220808, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113025103) 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, 9418753 + ... + 9418764.
It is an arithmetic number, because the mean of its divisors is an integer number (28256277).
Almost surely, 2113025102 is an apocalyptic number.
113025102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113025102 is a wasteful number, since it uses less digits than its factorization.
113025102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18837522.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 113025102 is about 10631.3264459333. The cubic root of 113025102 is about 483.4946088309.
Adding to 113025102 its reverse (201520311), we get a palindrome (314545413).
The spelling of 113025102 in words is "one hundred thirteen million, twenty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •