Base | Representation |
---|---|
bin | 1101011110010… |
… | …01011010100001 |
3 | 21212200010220011 |
4 | 12233021122201 |
5 | 212413211000 |
6 | 15114244521 |
7 | 2541451012 |
oct | 657113241 |
9 | 255603804 |
10 | 113022625 |
11 | 58886631 |
12 | 31a26741 |
13 | 1a5530c1 |
14 | 11021009 |
15 | 9dc82ba |
hex | 6bc96a1 |
113022625 has 8 divisors (see below), whose sum is σ = 141052392. Its totient is φ = 90418000.
The previous prime is 113022617. The next prime is 113022629. The reversal of 113022625 is 526220311.
It can be written as a sum of positive squares in 4 ways, for example, as 2099601 + 110923024 = 1449^2 + 10532^2 .
It is not a de Polignac number, because 113022625 - 23 = 113022617 is a prime.
It is a super-2 number, since 2×1130226252 = 25548227523781250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113022596 and 113022605.
It is not an unprimeable number, because it can be changed into a prime (113022629) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451966 + ... + 452215.
It is an arithmetic number, because the mean of its divisors is an integer number (17631549).
Almost surely, 2113022625 is an apocalyptic number.
It is an amenable number.
113022625 is a deficient number, since it is larger than the sum of its proper divisors (28029767).
113022625 is an frugal number, since it uses more digits than its factorization.
113022625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 904196 (or 904186 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 113022625 is about 10631.2099499540. The cubic root of 113022625 is about 483.4910767988.
Adding to 113022625 its reverse (526220311), we get a palindrome (639242936).
The spelling of 113022625 in words is "one hundred thirteen million, twenty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •