Search a number
-
+
54658023302063 is a prime number
BaseRepresentation
bin11000110110110000100000…
…00100000010001110101111
321011112020220121210011111202
430123120100010002032233
524131004112431131223
6312125314350240115
714340624525256226
oct1433302004021657
9234466817704452
1054658023302063
1116463379249955
1261691114b603b
1324662ca22a12c
14d6d668d2dcbd
1564bba98cc428
hex31b6101023af

54658023302063 has 2 divisors, whose sum is σ = 54658023302064. Its totient is φ = 54658023302062.

The previous prime is 54658023302053. The next prime is 54658023302149. The reversal of 54658023302063 is 36020332085645.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 54658023302063 - 212 = 54658023297967 is a prime.

It is a super-2 number, since 2×546580233020632 (a number of 28 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 54658023301999 and 54658023302017.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (54658023302053) 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, 27329011651031 + 27329011651032.

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

Almost surely, 254658023302063 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3110400, while the sum is 47.

The spelling of 54658023302063 in words is "fifty-four trillion, six hundred fifty-eight billion, twenty-three million, three hundred two thousand, sixty-three".