Search a number
-
+
46917067861 is a prime number
BaseRepresentation
bin101011101100011110…
…011010010001010101
311111002201201222210001
4223230132122101111
51232041232132421
633315311331301
73250435332256
oct535436322125
9144081658701
1046917067861
1118996509554
129114520b31
13456913c621
1423b10dab2d
151348dbd691
hexaec79a455

46917067861 has 2 divisors, whose sum is σ = 46917067862. Its totient is φ = 46917067860.

The previous prime is 46917067819. The next prime is 46917067867. The reversal of 46917067861 is 16876071964.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 36301680900 + 10615386961 = 190530^2 + 103031^2 .

It is a cyclic number.

It is not a de Polignac number, because 46917067861 - 29 = 46917067349 is a prime.

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

It is a congruent number.

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

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

Almost surely, 246917067861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3048192, while the sum is 55.

The spelling of 46917067861 in words is "forty-six billion, nine hundred seventeen million, sixty-seven thousand, eight hundred sixty-one".