Search a number
-
+
46515054613 is a prime number
BaseRepresentation
bin101011010100100000…
…110110100000010101
311110001201021121021111
4223110200312200111
51230230323221423
633211351015021
73234454304056
oct532440664025
9143051247244
1046515054613
11187aa598aa5
12902196a471
134503a74871
14237397072d
15132395d60d
hexad4836815

46515054613 has 2 divisors, whose sum is σ = 46515054614. Its totient is φ = 46515054612.

The previous prime is 46515054601. The next prime is 46515054631. The reversal of 46515054613 is 31645051564.

It is a happy number.

Together with next prime (46515054631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 43594516849 + 2920537764 = 208793^2 + 54042^2 .

It is a cyclic number.

It is not a de Polignac number, because 46515054613 - 229 = 45978183701 is a prime.

It is a congruent number.

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

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

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

Almost surely, 246515054613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216000, while the sum is 40.

The spelling of 46515054613 in words is "forty-six billion, five hundred fifteen million, fifty-four thousand, six hundred thirteen".