Base | Representation |
---|---|
bin | 1011010010101001… |
… | …1101100111100001 |
3 | 21211020102021211022 |
4 | 2310222131213201 |
5 | 22201420431431 |
6 | 1220433255225 |
7 | 135053221601 |
oct | 26452354741 |
9 | 7736367738 |
10 | 3031030241 |
11 | 1315a34978 |
12 | 707104515 |
13 | 393c5a425 |
14 | 20a7a2c01 |
15 | 12b17307b |
hex | b4a9d9e1 |
3031030241 has 2 divisors, whose sum is σ = 3031030242. Its totient is φ = 3031030240.
The previous prime is 3031030231. The next prime is 3031030243. The reversal of 3031030241 is 1420301303.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2996467600 + 34562641 = 54740^2 + 5879^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3031030241 is a prime.
Together with 3031030243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (3031030243) 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, 1515515120 + 1515515121.
It is an arithmetic number, because the mean of its divisors is an integer number (1515515121).
Almost surely, 23031030241 is an apocalyptic number.
It is an amenable number.
3031030241 is a deficient number, since it is larger than the sum of its proper divisors (1).
3031030241 is an equidigital number, since it uses as much as digits as its factorization.
3031030241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3031030241 is about 55054.7930792588. The cubic root of 3031030241 is about 1447.2051182558.
Adding to 3031030241 its reverse (1420301303), we get a palindrome (4451331544).
The spelling of 3031030241 in words is "three billion, thirty-one million, thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •