[go: up one dir, main page]

Search a number
-
+
273705131 = 7216133463
BaseRepresentation
bin10000010100000…
…110100010101011
3201002000122212002
4100110012202223
51030032031011
643054241215
76532312100
oct2024064253
9632018762
10273705131
11130554797
12777b620b
13449223cb
14284caaa7
1519067c3b
hex105068ab

273705131 has 12 divisors (see below), whose sum is σ = 318681072. Its totient is φ = 234391248.

The previous prime is 273705121. The next prime is 273705137. The reversal of 273705131 is 131507372.

It is not a de Polignac number, because 273705131 - 26 = 273705067 is a prime.

It is a super-2 number, since 2×2737051312 = 149828997471454322, 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 = 273705094 and 273705103.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 77306 + ... + 80768.

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

Almost surely, 2273705131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5090 (or 5083 counting only the distinct ones).

The product of its (nonzero) digits is 4410, while the sum is 29.

The square root of 273705131 is about 16544.0361157730. The cubic root of 273705131 is about 649.2734532834.

The spelling of 273705131 in words is "two hundred seventy-three million, seven hundred five thousand, one hundred thirty-one".

Divisors: 1 7 49 1613 3463 11291 24241 79037 169687 5585819 39100733 273705131