Search a number
-
+
1150155535 = 5230031107
BaseRepresentation
bin100010010001101…
…1111101100001111
32222011012221210011
41010203133230033
54323414434120
6310043454051
740334106064
oct10443375417
92864187704
101150155535
11540261971
12281227327
13154391b09
14aca76c6b
156ae91c5a
hex448dfb0f

1150155535 has 4 divisors (see below), whose sum is σ = 1380186648. Its totient is φ = 920124424.

The previous prime is 1150155527. The next prime is 1150155563. The reversal of 1150155535 is 5355510511.

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 1150155535 - 23 = 1150155527 is a prime.

It is a super-2 number, since 2×11501555352 = 2645715509382272450, which contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1150155497 and 1150155506.

It is a congruent number.

It is an unprimeable number.

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, 115015549 + ... + 115015558.

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

Almost surely, 21150155535 is an apocalyptic number.

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

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

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

The sum of its prime factors is 230031112.

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

The square root of 1150155535 is about 33913.9430765578. The cubic root of 1150155535 is about 1047.7367836206.

The spelling of 1150155535 in words is "one billion, one hundred fifty million, one hundred fifty-five thousand, five hundred thirty-five".

Divisors: 1 5 230031107 1150155535