Base | Representation |
---|---|
bin | 1111010100101100… |
… | …0000001001101101 |
3 | 101121122220101202011 |
4 | 3311023000021231 |
5 | 31411001132000 |
6 | 1520054201221 |
7 | 203634330322 |
oct | 36513001155 |
9 | 11548811664 |
10 | 4113302125 |
11 | 1820940849 |
12 | 969653211 |
13 | 507241aaa |
14 | 2b0408b49 |
15 | 1911a62ba |
hex | f52c026d |
4113302125 has 8 divisors (see below), whose sum is σ = 5133401208. Its totient is φ = 3290641600.
The previous prime is 4113302107. The next prime is 4113302399. The reversal of 4113302125 is 5212033114.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 10771524 + 4102530601 = 3282^2 + 64051^2 .
It is not a de Polignac number, because 4113302125 - 229 = 3576431213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4113302096 and 4113302105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16453084 + ... + 16453333.
It is an arithmetic number, because the mean of its divisors is an integer number (641675151).
Almost surely, 24113302125 is an apocalyptic number.
It is an amenable number.
4113302125 is a deficient number, since it is larger than the sum of its proper divisors (1020099083).
4113302125 is an equidigital number, since it uses as much as digits as its factorization.
4113302125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32906432 (or 32906422 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 4113302125 is about 64135.0304046081. The cubic root of 4113302125 is about 1602.2497161127.
Adding to 4113302125 its reverse (5212033114), we get a palindrome (9325335239).
The spelling of 4113302125 in words is "four billion, one hundred thirteen million, three hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •