Search a number
-
+
1545130047661 is a prime number
BaseRepresentation
bin10110011111000000111…
…011010111100010101101
312110201020202210002122021
4112133000323113202231
5200303411243011121
63141453431150141
7216426522463354
oct26370073274255
95421222702567
101545130047661
115463166a3142
1220b558b15351
13b292225bb15
1454adb2ac99b
152a2d4425641
hex167c0ed78ad

1545130047661 has 2 divisors, whose sum is σ = 1545130047662. Its totient is φ = 1545130047660.

The previous prime is 1545130047623. The next prime is 1545130047667. The reversal of 1545130047661 is 1667400315451.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1248987291561 + 296142756100 = 1117581^2 + 544190^2 .

It is a cyclic number.

It is not a de Polignac number, because 1545130047661 - 27 = 1545130047533 is a prime.

It is a super-3 number, since 3×15451300476613 (a number of 38 digits) contains 333 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1545130047667) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 772565023830 + 772565023831.

It is an arithmetic number, because the mean of its divisors is an integer number (772565023831).

Almost surely, 21545130047661 is an apocalyptic number.

It is an amenable number.

1545130047661 is a deficient number, since it is larger than the sum of its proper divisors (1).

1545130047661 is an equidigital number, since it uses as much as digits as its factorization.

1545130047661 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 302400, while the sum is 43.

The spelling of 1545130047661 in words is "one trillion, five hundred forty-five billion, one hundred thirty million, forty-seven thousand, six hundred sixty-one".