Base | Representation |
---|---|
bin | 1011010111001100… |
… | …1101011000010001 |
3 | 21212120022010221121 |
4 | 2311303031120101 |
5 | 22221311201431 |
6 | 1222354122241 |
7 | 135404265346 |
oct | 26563153021 |
9 | 7776263847 |
10 | 3050100241 |
11 | 132577a501 |
12 | 711580381 |
13 | 397ba6456 |
14 | 20d1287cd |
15 | 12cb8d611 |
hex | b5ccd611 |
3050100241 has 2 divisors, whose sum is σ = 3050100242. Its totient is φ = 3050100240.
The previous prime is 3050100197. The next prime is 3050100253. The reversal of 3050100241 is 1420010503.
3050100241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1550784400 + 1499315841 = 39380^2 + 38721^2 .
It is a cyclic number.
It is not a de Polignac number, because 3050100241 - 227 = 2915882513 is a prime.
It is a super-2 number, since 2×30501002412 = 18606222960296516162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3050100281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1525050120 + 1525050121.
It is an arithmetic number, because the mean of its divisors is an integer number (1525050121).
Almost surely, 23050100241 is an apocalyptic number.
It is an amenable number.
3050100241 is a deficient number, since it is larger than the sum of its proper divisors (1).
3050100241 is an equidigital number, since it uses as much as digits as its factorization.
3050100241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 3050100241 is about 55227.7126178516. The cubic root of 3050100241 is about 1450.2338490853.
Adding to 3050100241 its reverse (1420010503), we get a palindrome (4470110744).
The spelling of 3050100241 in words is "three billion, fifty million, one hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •