Search a number
-
+
46920758531 is a prime number
BaseRepresentation
bin101011101100101100…
…011111010100000011
311111002222200111102112
4223230230133110003
51232043203233111
633315522405535
73250511603243
oct535454372403
9144088614375
1046920758531
11189985aa399
1291158008ab
134569b3245a
1423b17bbb23
15134939be8b
hexaecb1f503

46920758531 has 2 divisors, whose sum is σ = 46920758532. Its totient is φ = 46920758530.

The previous prime is 46920758527. The next prime is 46920758551. The reversal of 46920758531 is 13585702964.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 46920758531 - 22 = 46920758527 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 46920758531.

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

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

It is a 2-persistent number, because it is pandigital, and so is 2⋅46920758531 = 93841517062, but 3⋅46920758531 = 140762275593 is not.

Almost surely, 246920758531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1814400, while the sum is 50.

The spelling of 46920758531 in words is "forty-six billion, nine hundred twenty million, seven hundred fifty-eight thousand, five hundred thirty-one".