Base | Representation |
---|---|
bin | 1100000111011… |
… | …10011110111101 |
3 | 21002020212001002 |
4 | 12003232132331 |
5 | 202004441000 |
6 | 14030300045 |
7 | 2342632616 |
oct | 603563675 |
9 | 232225032 |
10 | 101640125 |
11 | 52411804 |
12 | 2a057625 |
13 | 180991b2 |
14 | d6dac0d |
15 | 8dca8d5 |
hex | 60ee7bd |
101640125 has 8 divisors (see below), whose sum is σ = 126847032. Its totient is φ = 81312000.
The previous prime is 101640109. The next prime is 101640131. The reversal of 101640125 is 521046101.
It can be written as a sum of positive squares in 4 ways, for example, as 5541316 + 96098809 = 2354^2 + 9803^2 .
It is not a de Polignac number, because 101640125 - 24 = 101640109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101640097 and 101640106.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 406436 + ... + 406685.
It is an arithmetic number, because the mean of its divisors is an integer number (15855879).
Almost surely, 2101640125 is an apocalyptic number.
It is an amenable number.
101640125 is a deficient number, since it is larger than the sum of its proper divisors (25206907).
101640125 is an frugal number, since it uses more digits than its factorization.
101640125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813136 (or 813126 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 101640125 is about 10081.6727282728. The cubic root of 101640125 is about 466.6827304561.
Adding to 101640125 its reverse (521046101), we get a palindrome (622686226).
The spelling of 101640125 in words is "one hundred one million, six hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •