Base | Representation |
---|---|
bin | 1011010011001000… |
… | …1111111000100101 |
3 | 21211101020222102012 |
4 | 2310302033320211 |
5 | 22202431234031 |
6 | 1220545124005 |
7 | 135106452002 |
oct | 26462177045 |
9 | 7741228365 |
10 | 3033071141 |
11 | 13170a9271 |
12 | 707929605 |
13 | 3944c3369 |
14 | 20ab748a9 |
15 | 12b427b2b |
hex | b4c8fe25 |
3033071141 has 2 divisors, whose sum is σ = 3033071142. Its totient is φ = 3033071140.
The previous prime is 3033071117. The next prime is 3033071159. The reversal of 3033071141 is 1411703303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1947368641 + 1085702500 = 44129^2 + 32950^2 .
It is an emirp because it is prime and its reverse (1411703303) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3033071141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3033071101) 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 as a sum of consecutive naturals, namely, 1516535570 + 1516535571.
It is an arithmetic number, because the mean of its divisors is an integer number (1516535571).
Almost surely, 23033071141 is an apocalyptic number.
It is an amenable number.
3033071141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3033071141 is an equidigital number, since it uses as much as digits as its factorization.
3033071141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 3033071141 is about 55073.3251311377. The cubic root of 3033071141 is about 1447.5298635314.
Adding to 3033071141 its reverse (1411703303), we get a palindrome (4444774444).
The spelling of 3033071141 in words is "three billion, thirty-three million, seventy-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •