Base | Representation |
---|---|
bin | 1100110000100… |
… | …00101100010101 |
3 | 21110101100010110 |
4 | 12120100230111 |
5 | 204344220000 |
6 | 14341513233 |
7 | 2436452526 |
oct | 630205425 |
9 | 243340113 |
10 | 107023125 |
11 | 55459070 |
12 | 2ba12819 |
13 | 192323c1 |
14 | 102dc84d |
15 | 95e0850 |
hex | 6610b15 |
107023125 has 40 divisors (see below), whose sum is σ = 194562720. Its totient is φ = 51880000.
The previous prime is 107023099. The next prime is 107023127. The reversal of 107023125 is 521320701.
It is not a de Polignac number, because 107023125 - 26 = 107023061 is a prime.
It is a super-2 number, since 2×1070231252 = 22907898569531250, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107023127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 18031 + ... + 23219.
It is an arithmetic number, because the mean of its divisors is an integer number (4864068).
Almost surely, 2107023125 is an apocalyptic number.
107023125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
107023125 is a deficient number, since it is larger than the sum of its proper divisors (87539595).
107023125 is an equidigital number, since it uses as much as digits as its factorization.
107023125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5223 (or 5208 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 107023125 is about 10345.1981614660. The cubic root of 107023125 is about 474.7801383229.
Adding to 107023125 its reverse (521320701), we get a palindrome (628343826).
The spelling of 107023125 in words is "one hundred seven million, twenty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •