Base | Representation |
---|---|
bin | 1011010001000010… |
… | …0010001010110101 |
3 | 21210202121221221212 |
4 | 2310100202022311 |
5 | 22143200430031 |
6 | 1220031451205 |
7 | 134641362146 |
oct | 26420421265 |
9 | 7722557855 |
10 | 3024233141 |
11 | 1312112136 |
12 | 704986b05 |
13 | 39271a687 |
14 | 209913acd |
15 | 12a77e12b |
hex | b44222b5 |
3024233141 has 2 divisors, whose sum is σ = 3024233142. Its totient is φ = 3024233140.
The previous prime is 3024233099. The next prime is 3024233197. The reversal of 3024233141 is 1413324203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2976138916 + 48094225 = 54554^2 + 6935^2 .
It is a cyclic number.
It is not a de Polignac number, because 3024233141 - 26 = 3024233077 is a prime.
It is a super-2 number, since 2×30242331412 = 18291972182245451762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3024233041) 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 as a sum of consecutive naturals, namely, 1512116570 + 1512116571.
It is an arithmetic number, because the mean of its divisors is an integer number (1512116571).
Almost surely, 23024233141 is an apocalyptic number.
It is an amenable number.
3024233141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3024233141 is an equidigital number, since it uses as much as digits as its factorization.
3024233141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 3024233141 is about 54993.0281126617. The cubic root of 3024233141 is about 1446.1225204455.
Adding to 3024233141 its reverse (1413324203), we get a palindrome (4437557344).
The spelling of 3024233141 in words is "three billion, twenty-four million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •