Search a number
-
+
46948365054233 is a prime number
BaseRepresentation
bin10101010110011000001001…
…00111110011000100011001
320011020012221021121222002222
422223030010213303010121
522123200222423213413
6243503440421433425
712613623152363366
oct1253140447630431
9204205837558088
1046948365054233
1113a6076514a415
125322aa856b875
13202729a503436
14b84454bd146d
1556637c272b08
hex2ab3049f3119

46948365054233 has 2 divisors, whose sum is σ = 46948365054234. Its totient is φ = 46948365054232.

The previous prime is 46948365054179. The next prime is 46948365054317. The reversal of 46948365054233 is 33245056384964.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 45639050126224 + 1309314928009 = 6755668^2 + 1144253^2 .

It is a cyclic number.

It is not a de Polignac number, because 46948365054233 - 26 = 46948365054169 is a prime.

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

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

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

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

Almost surely, 246948365054233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 223948800, while the sum is 62.

The spelling of 46948365054233 in words is "forty-six trillion, nine hundred forty-eight billion, three hundred sixty-five million, fifty-four thousand, two hundred thirty-three".