Base | Representation |
---|---|
bin | 1111110011001010… |
… | …1000101001101101 |
3 | 101221120102211120012 |
4 | 3330302220221231 |
5 | 32141212212031 |
6 | 1540502103005 |
7 | 210046012511 |
oct | 37462505155 |
9 | 11846384505 |
10 | 4241132141 |
11 | 1887010394 |
12 | 9a441aa65 |
13 | 52787a95c |
14 | 2c33a2141 |
15 | 19c506b2b |
hex | fcca8a6d |
4241132141 has 4 divisors (see below), whose sum is σ = 4355757372. Its totient is φ = 4126506912.
The previous prime is 4241132123. The next prime is 4241132213. The reversal of 4241132141 is 1412311424.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1834837225 + 2406294916 = 42835^2 + 49054^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4241132141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241132641) 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, 57312560 + ... + 57312633.
It is an arithmetic number, because the mean of its divisors is an integer number (1088939343).
Almost surely, 24241132141 is an apocalyptic number.
It is an amenable number.
4241132141 is a deficient number, since it is larger than the sum of its proper divisors (114625231).
4241132141 is a wasteful number, since it uses less digits than its factorization.
4241132141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114625230.
The product of its digits is 768, while the sum is 23.
The square root of 4241132141 is about 65123.9751627617. The cubic root of 4241132141 is about 1618.6785114228.
Adding to 4241132141 its reverse (1412311424), we get a palindrome (5653443565).
The spelling of 4241132141 in words is "four billion, two hundred forty-one million, one hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •