Base | Representation |
---|---|
bin | 1101011111110… |
… | …01110110100001 |
3 | 21220001020001022 |
4 | 12233321312201 |
5 | 212441033100 |
6 | 15122415225 |
7 | 2543235311 |
oct | 657716641 |
9 | 256036038 |
10 | 113221025 |
11 | 58a016a5 |
12 | 31b01515 |
13 | 1a5c24b8 |
14 | 11073441 |
15 | 9e16e85 |
hex | 6bf9da1 |
113221025 has 12 divisors (see below), whose sum is σ = 141685500. Its totient is φ = 89743680.
The previous prime is 113221013. The next prime is 113221027. The reversal of 113221025 is 520122311.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 12559936 + 100661089 = 3544^2 + 10033^2 .
It is not a de Polignac number, because 113221025 - 28 = 113220769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113220994 and 113221012.
It is not an unprimeable number, because it can be changed into a prime (113221027) 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 11 ways as a sum of consecutive naturals, for example, 18050 + ... + 23499.
It is an arithmetic number, because the mean of its divisors is an integer number (11807125).
Almost surely, 2113221025 is an apocalyptic number.
It is an amenable number.
113221025 is a deficient number, since it is larger than the sum of its proper divisors (28464475).
113221025 is a wasteful number, since it uses less digits than its factorization.
113221025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41668 (or 41663 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 113221025 is about 10640.5368755528. The cubic root of 113221025 is about 483.7738182870.
Adding to 113221025 its reverse (520122311), we get a palindrome (633343336).
The spelling of 113221025 in words is "one hundred thirteen million, two hundred twenty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •