Base | Representation |
---|---|
bin | 1011010110000011… |
… | …1111001010111101 |
3 | 21212020022110102112 |
4 | 2311200333022331 |
5 | 22214100322303 |
6 | 1222103503405 |
7 | 135315552014 |
oct | 26540771275 |
9 | 7766273375 |
10 | 3045323453 |
11 | 1323007647 |
12 | 70ba57b65 |
13 | 396bc3153 |
14 | 20c643a7b |
15 | 12c5480d8 |
hex | b583f2bd |
3045323453 has 2 divisors, whose sum is σ = 3045323454. Its totient is φ = 3045323452.
The previous prime is 3045323431. The next prime is 3045323459. The reversal of 3045323453 is 3543235403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2875855129 + 169468324 = 53627^2 + 13018^2 .
It is a cyclic number.
It is not a de Polignac number, because 3045323453 - 212 = 3045319357 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 (3045323459) 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, 1522661726 + 1522661727.
It is an arithmetic number, because the mean of its divisors is an integer number (1522661727).
Almost surely, 23045323453 is an apocalyptic number.
It is an amenable number.
3045323453 is a deficient number, since it is larger than the sum of its proper divisors (1).
3045323453 is an equidigital number, since it uses as much as digits as its factorization.
3045323453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 32.
The square root of 3045323453 is about 55184.4493766133. The cubic root of 3045323453 is about 1449.4763789877.
Adding to 3045323453 its reverse (3543235403), we get a palindrome (6588558856).
The spelling of 3045323453 in words is "three billion, forty-five million, three hundred twenty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •