Base | Representation |
---|---|
bin | 1111010100101001… |
… | …0110001010011101 |
3 | 101121122120122211101 |
4 | 3311022112022131 |
5 | 31410430131031 |
6 | 1520050353101 |
7 | 203633013031 |
oct | 36512261235 |
9 | 11548518741 |
10 | 4113130141 |
11 | 182083360a |
12 | 96958b791 |
13 | 5071b1723 |
14 | 2b03a21c1 |
15 | 191170361 |
hex | f529629d |
4113130141 has 4 divisors (see below), whose sum is σ = 4113277312. Its totient is φ = 4112982972.
The previous prime is 4113130139. The next prime is 4113130157. The reversal of 4113130141 is 1410313114.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4113130141 - 21 = 4113130139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4113130111) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 17325 + ... + 92338.
It is an arithmetic number, because the mean of its divisors is an integer number (1028319328).
Almost surely, 24113130141 is an apocalyptic number.
It is an amenable number.
4113130141 is a deficient number, since it is larger than the sum of its proper divisors (147171).
4113130141 is a wasteful number, since it uses less digits than its factorization.
4113130141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147170.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 4113130141 is about 64133.6895944713. The cubic root of 4113130141 is about 1602.2273848933.
Adding to 4113130141 its reverse (1410313114), we get a palindrome (5523443255).
The spelling of 4113130141 in words is "four billion, one hundred thirteen million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •