Base | Representation |
---|---|
bin | 1011100100011011… |
… | …1011110111100001 |
3 | 22000102201222110212 |
4 | 2321012323313201 |
5 | 22330013244131 |
6 | 1232055503505 |
7 | 136650122162 |
oct | 27106736741 |
9 | 8012658425 |
10 | 3105603041 |
11 | 1354039592 |
12 | 728087b95 |
13 | 3a653a448 |
14 | 216655769 |
15 | 1329a3a2b |
hex | b91bbde1 |
3105603041 has 2 divisors, whose sum is σ = 3105603042. Its totient is φ = 3105603040.
The previous prime is 3105603031. The next prime is 3105603047. The reversal of 3105603041 is 1403065013.
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., 2822690641 + 282912400 = 53129^2 + 16820^2 .
It is a cyclic number.
It is not a de Polignac number, because 3105603041 - 230 = 2031861217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3105602998 and 3105603016.
It is not a weakly prime, because it can be changed into another prime (3105603047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552801520 + 1552801521.
It is an arithmetic number, because the mean of its divisors is an integer number (1552801521).
Almost surely, 23105603041 is an apocalyptic number.
It is an amenable number.
3105603041 is a deficient number, since it is larger than the sum of its proper divisors (1).
3105603041 is an equidigital number, since it uses as much as digits as its factorization.
3105603041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 3105603041 is about 55727.9377063246. The cubic root of 3105603041 is about 1458.9776794205.
Adding to 3105603041 its reverse (1403065013), we get a palindrome (4508668054).
The spelling of 3105603041 in words is "three billion, one hundred five million, six hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •