Base | Representation |
---|---|
bin | 100110100100… |
… | …110001111101 |
3 | 201000202020011 |
4 | 212210301331 |
5 | 10042042000 |
6 | 1000423221 |
7 | 151644262 |
oct | 46446175 |
9 | 21022204 |
10 | 10112125 |
11 | 5787431 |
12 | 3477b11 |
13 | 213090a |
14 | 14b3269 |
15 | d4b2ba |
hex | 9a4c7d |
10112125 has 8 divisors (see below), whose sum is σ = 12620088. Its totient is φ = 8089600.
The previous prime is 10112101. The next prime is 10112129. The reversal of 10112125 is 52121101.
It can be written as a sum of positive squares in 4 ways, for example, as 6084 + 10106041 = 78^2 + 3179^2 .
It is not a de Polignac number, because 10112125 - 215 = 10079357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112129) 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 7 ways as a sum of consecutive naturals, for example, 40324 + ... + 40573.
It is an arithmetic number, because the mean of its divisors is an integer number (1577511).
Almost surely, 210112125 is an apocalyptic number.
It is an amenable number.
10112125 is a deficient number, since it is larger than the sum of its proper divisors (2507963).
10112125 is an frugal number, since it uses more digits than its factorization.
10112125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80912 (or 80902 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 13.
The square root of 10112125 is about 3179.9567607123. The cubic root of 10112125 is about 216.2456980667.
Adding to 10112125 its reverse (52121101), we get a palindrome (62233226).
It can be divided in two parts, 1011 and 2125, that added together give a square (3136 = 562).
The spelling of 10112125 in words is "ten million, one hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •