Search a number
-
+
46530150511 = 133579242347
BaseRepresentation
bin101011010101011010…
…011100000001101111
311110002202200112221211
4223111122130001233
51230243204304021
633213050335251
73235026516325
oct532532340157
9143082615854
1046530150511
1118808069849
129026a2a527
134506c2ba50
14237597dd15
151324e413e1
hexad569c06f

46530150511 has 4 divisors (see below), whose sum is σ = 50109392872. Its totient is φ = 42950908152.

The previous prime is 46530150449. The next prime is 46530150581. The reversal of 46530150511 is 11505103564.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 46530150511 - 219 = 46529626223 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (46530150581) 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 in 3 ways as a sum of consecutive naturals, for example, 1789621161 + ... + 1789621186.

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

Almost surely, 246530150511 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3579242360.

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

The spelling of 46530150511 in words is "forty-six billion, five hundred thirty million, one hundred fifty thousand, five hundred eleven".

Divisors: 1 13 3579242347 46530150511