Base | Representation |
---|---|
bin | 1011010000100000… |
… | …0001101111000101 |
3 | 21210121102122222021 |
4 | 2310020001233011 |
5 | 22142113100031 |
6 | 1215512003141 |
7 | 134613413533 |
oct | 26410015705 |
9 | 7717378867 |
10 | 3022003141 |
11 | 1310929763 |
12 | 7040904b1 |
13 | 392119651 |
14 | 2094d3153 |
15 | 12a48d511 |
hex | b4201bc5 |
3022003141 has 2 divisors, whose sum is σ = 3022003142. Its totient is φ = 3022003140.
The previous prime is 3022003139. The next prime is 3022003169. The reversal of 3022003141 is 1413002203.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2721708900 + 300294241 = 52170^2 + 17329^2 .
It is a cyclic number.
It is not a de Polignac number, because 3022003141 - 21 = 3022003139 is a prime.
Together with 3022003139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3022003111) 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, 1511001570 + 1511001571.
It is an arithmetic number, because the mean of its divisors is an integer number (1511001571).
Almost surely, 23022003141 is an apocalyptic number.
It is an amenable number.
3022003141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022003141 is an equidigital number, since it uses as much as digits as its factorization.
3022003141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3022003141 is about 54972.7490762469. The cubic root of 3022003141 is about 1445.7669872090.
Adding to 3022003141 its reverse (1413002203), we get a palindrome (4435005344).
The spelling of 3022003141 in words is "three billion, twenty-two million, three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •