Base | Representation |
---|---|
bin | 1100101011111… |
… | …00011000001001 |
3 | 21102020110210110 |
4 | 12111330120021 |
5 | 204220300000 |
6 | 14320504533 |
7 | 2431342431 |
oct | 625743011 |
9 | 242213713 |
10 | 106415625 |
11 | 550836a8 |
12 | 2b77b149 |
13 | 1907ba34 |
14 | 101c12c1 |
15 | 9520850 |
hex | 657c609 |
106415625 has 24 divisors (see below), whose sum is σ = 177363648. Its totient is φ = 56750000.
The previous prime is 106415611. The next prime is 106415627. The reversal of 106415625 is 526514601.
It is not a de Polignac number, because 106415625 - 28 = 106415369 is a prime.
It is a super-2 number, since 2×1064156252 = 22648570488281250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106415592 and 106415601.
It is not an unprimeable number, because it can be changed into a prime (106415627) 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 23 ways as a sum of consecutive naturals, for example, 3700 + ... + 15050.
It is an arithmetic number, because the mean of its divisors is an integer number (7390152).
Almost surely, 2106415625 is an apocalyptic number.
106415625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106415625 is a deficient number, since it is larger than the sum of its proper divisors (70948023).
106415625 is an frugal number, since it uses more digits than its factorization.
106415625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11379 (or 11359 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 106415625 is about 10315.7949281672. The cubic root of 106415625 is about 473.8800948288.
The spelling of 106415625 in words is "one hundred six million, four hundred fifteen thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •