Search a number
-
+
50140695 = 35112291327
BaseRepresentation
bin1011111101000…
…1011000010111
310111100102002210
42333101120113
5100314000240
64550404503
71146121533
oct277213027
9114312083
1050140695
11263374a0
1214960733
13a507467
146932bc3
154606780
hex2fd1617

50140695 has 32 divisors (see below), whose sum is σ = 87966720. Its totient is φ = 24186240.

The previous prime is 50140693. The next prime is 50140711. The reversal of 50140695 is 59604105.

It is not a de Polignac number, because 50140695 - 21 = 50140693 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37122 + ... + 38448.

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

Almost surely, 250140695 is an apocalyptic number.

50140695 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1575.

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

The square root of 50140695 is about 7081.0094619341. The cubic root of 50140695 is about 368.7483761300.

It can be divided in two parts, 501406 and 95, that added together give a triangular number (501501 = T1001).

The spelling of 50140695 in words is "fifty million, one hundred forty thousand, six hundred ninety-five".

Divisors: 1 3 5 11 15 33 55 165 229 687 1145 1327 2519 3435 3981 6635 7557 12595 14597 19905 37785 43791 72985 218955 303883 911649 1519415 3342713 4558245 10028139 16713565 50140695