Base | Representation |
---|---|
bin | 1011010001000000… |
… | …0001101100101101 |
3 | 21210202101012111221 |
4 | 2310100001230231 |
5 | 22143132201031 |
6 | 1220024543341 |
7 | 134640266326 |
oct | 26420015455 |
9 | 7722335457 |
10 | 3024100141 |
11 | 1312031217 |
12 | 704921b51 |
13 | 3926a1c8a |
14 | 2098bb44d |
15 | 12a754a11 |
hex | b4401b2d |
3024100141 has 6 divisors (see below), whose sum is σ = 3069914190. Its totient is φ = 2978959896.
The previous prime is 3024100139. The next prime is 3024100151. The reversal of 3024100141 is 1410014203.
It can be written as a sum of positive squares in only one way, i.e., 2606510916 + 417589225 = 51054^2 + 20435^2 .
It is not a de Polignac number, because 3024100141 - 21 = 3024100139 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 (3024100151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 332346 + ... + 341323.
It is an arithmetic number, because the mean of its divisors is an integer number (511652365).
Almost surely, 23024100141 is an apocalyptic number.
It is an amenable number.
3024100141 is a deficient number, since it is larger than the sum of its proper divisors (45814049).
3024100141 is an frugal number, since it uses more digits than its factorization.
3024100141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673803 (or 673736 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 3024100141 is about 54991.8188551715. The cubic root of 3024100141 is about 1446.1013208988.
Adding to 3024100141 its reverse (1410014203), we get a palindrome (4434114344).
The spelling of 3024100141 in words is "three billion, twenty-four million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •