Search a number
-
+
46915005001 = 460310192267
BaseRepresentation
bin101011101100010110…
…100010101001001001
311111002120212012001211
4223230112202221021
51232040220130001
633315155213121
73250411651144
oct535426425111
9144076765054
1046915005001
111899532a707
1291138a71a1
1345688996b7
1423b0b2105b
151348b12351
hexaec5a2a49

46915005001 has 4 divisors (see below), whose sum is σ = 46925201872. Its totient is φ = 46904808132.

The previous prime is 46915004993. The next prime is 46915005019. The reversal of 46915005001 is 10050051964.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 46915005001 - 23 = 46915004993 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (46915003001) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5091531 + ... + 5100736.

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

Almost surely, 246915005001 is an apocalyptic number.

It is an amenable number.

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

46915005001 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 10196870.

The product of its (nonzero) digits is 5400, while the sum is 31.

Adding to 46915005001 its reverse (10050051964), we get a palindrome (56965056965).

The spelling of 46915005001 in words is "forty-six billion, nine hundred fifteen million, five thousand, one".

Divisors: 1 4603 10192267 46915005001