Base | Representation |
---|---|
bin | 101100010100000111010… |
… | …010010000110111100101 |
3 | 101210010022222201202022222 |
4 | 230110013102100313211 |
5 | 344343140013303221 |
6 | 10250545334402125 |
7 | 433004143154621 |
oct | 54240722206745 |
9 | 11703288652288 |
10 | 3045254041061 |
11 | a74537575611 |
12 | 412235500345 |
13 | 191221269bab |
14 | a75691b4181 |
15 | 543326139ab |
hex | 2c507490de5 |
3045254041061 has 2 divisors, whose sum is σ = 3045254041062. Its totient is φ = 3045254041060.
The previous prime is 3045254041057. The next prime is 3045254041097. The reversal of 3045254041061 is 1601404525403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3041253478561 + 4000562500 = 1743919^2 + 63250^2 .
It is a cyclic number.
It is not a de Polignac number, because 3045254041061 - 22 = 3045254041057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3045254041001) 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, 1522627020530 + 1522627020531.
It is an arithmetic number, because the mean of its divisors is an integer number (1522627020531).
Almost surely, 23045254041061 is an apocalyptic number.
It is an amenable number.
3045254041061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3045254041061 is an equidigital number, since it uses as much as digits as its factorization.
3045254041061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 3045254041061 its reverse (1601404525403), we get a palindrome (4646658566464).
The spelling of 3045254041061 in words is "three trillion, forty-five billion, two hundred fifty-four million, forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •