Base | Representation |
---|---|
bin | 1111010100100111… |
… | …1011010011100011 |
3 | 101121122101001220221 |
4 | 3311021323103203 |
5 | 31410413121011 |
6 | 1520044143511 |
7 | 203632044223 |
oct | 36511732343 |
9 | 11548331827 |
10 | 4113020131 |
11 | 18207689a0 |
12 | 969537b97 |
13 | 50717362c |
14 | 2b0374083 |
15 | 19114c971 |
hex | f527b4e3 |
4113020131 has 8 divisors (see below), whose sum is σ = 4550128128. Its totient is φ = 3686445000.
The previous prime is 4113020123. The next prime is 4113020141. The reversal of 4113020131 is 1310203114.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4113020131 - 23 = 4113020123 is a prime.
It is a super-2 number, since 2×41130201312 = 33833869196022514322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4113020111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2632395 + ... + 2633956.
It is an arithmetic number, because the mean of its divisors is an integer number (568766016).
Almost surely, 24113020131 is an apocalyptic number.
4113020131 is a deficient number, since it is larger than the sum of its proper divisors (437107997).
4113020131 is a wasteful number, since it uses less digits than its factorization.
4113020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5266433.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 4113020131 is about 64132.8319271806. The cubic root of 4113020131 is about 1602.2131003460.
Adding to 4113020131 its reverse (1310203114), we get a palindrome (5423223245).
The spelling of 4113020131 in words is "four billion, one hundred thirteen million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •