Base | Representation |
---|---|
bin | 1111011101011101… |
… | …1111110110010001 |
3 | 101201020012112222210 |
4 | 3313113133312101 |
5 | 31444413211423 |
6 | 1523451422333 |
7 | 204562353351 |
oct | 36727376621 |
9 | 11636175883 |
10 | 4150132113 |
11 | 183a706756 |
12 | 979a549a9 |
13 | 511a6879a |
14 | 2b5274b61 |
15 | 19452db93 |
hex | f75dfd91 |
4150132113 has 4 divisors (see below), whose sum is σ = 5533509488. Its totient is φ = 2766754740.
The previous prime is 4150132111. The next prime is 4150132127. The reversal of 4150132113 is 3112310514.
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 not a de Polignac number, because 4150132113 - 21 = 4150132111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4150132113.
It is not an unprimeable number, because it can be changed into a prime (4150132111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 691688683 + ... + 691688688.
It is an arithmetic number, because the mean of its divisors is an integer number (1383377372).
Almost surely, 24150132113 is an apocalyptic number.
It is an amenable number.
4150132113 is a deficient number, since it is larger than the sum of its proper divisors (1383377375).
4150132113 is a wasteful number, since it uses less digits than its factorization.
4150132113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1383377374.
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 4150132113 is about 64421.5190212091. The cubic root of 4150132113 is about 1607.0176277766.
Adding to 4150132113 its reverse (3112310514), we get a palindrome (7262442627).
The spelling of 4150132113 in words is "four billion, one hundred fifty million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •