Search a number
-
+
1150521013 = 6831684511
BaseRepresentation
bin100010010010011…
…1000111010110101
32222011220112010101
41010210320322311
54324013133023
6310055354101
740340160445
oct10444707265
92864815111
101150521013
11540491514
12281382931
1315448c285
14acb30125
156b0151ad
hex44938eb5

1150521013 has 4 divisors (see below), whose sum is σ = 1152206208. Its totient is φ = 1148835820.

The previous prime is 1150521007. The next prime is 1150521023. The reversal of 1150521013 is 3101250511.

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 a de Polignac number, because none of the positive numbers 2k-1150521013 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 21150521013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1685194.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 1150521013 is about 33919.3309633312. The cubic root of 1150521013 is about 1047.8477495378.

Adding to 1150521013 its reverse (3101250511), we get a palindrome (4251771524).

The spelling of 1150521013 in words is "one billion, one hundred fifty million, five hundred twenty-one thousand, thirteen".

Divisors: 1 683 1684511 1150521013