Base | Representation |
---|---|
bin | 1011010011001001… |
… | …1100000100111001 |
3 | 21211101100111220211 |
4 | 2310302130010321 |
5 | 22202434333311 |
6 | 1220550151121 |
7 | 135110050414 |
oct | 26462340471 |
9 | 7741314824 |
10 | 3033121081 |
11 | 1317132841 |
12 | 7079524a1 |
13 | 394510003 |
14 | 20ab88b7b |
15 | 12b437821 |
hex | b4c9c139 |
3033121081 has 2 divisors, whose sum is σ = 3033121082. Its totient is φ = 3033121080.
The previous prime is 3033120989. The next prime is 3033121097. The reversal of 3033121081 is 1801213303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1696121856 + 1336999225 = 41184^2 + 36565^2 .
It is an emirp because it is prime and its reverse (1801213303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3033121081 - 213 = 3033112889 is a prime.
It is a super-2 number, since 2×30331210812 = 18399646984013217122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3033121681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1516560540 + 1516560541.
It is an arithmetic number, because the mean of its divisors is an integer number (1516560541).
Almost surely, 23033121081 is an apocalyptic number.
It is an amenable number.
3033121081 is a deficient number, since it is larger than the sum of its proper divisors (1).
3033121081 is an equidigital number, since it uses as much as digits as its factorization.
3033121081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 3033121081 is about 55073.7785248116. The cubic root of 3033121081 is about 1447.5378080911.
Adding to 3033121081 its reverse (1801213303), we get a palindrome (4834334384).
The spelling of 3033121081 in words is "three billion, thirty-three million, one hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •