[go: up one dir, main page]

Search a number
-
+
136953 = 3215217
BaseRepresentation
bin100001011011111001
320221212100
4201123321
513340303
62534013
71110165
oct413371
9227770
10136953
1193993
1267309
134a44b
1437ca5
152a8a3
hex216f9

136953 has 6 divisors (see below), whose sum is σ = 197834. Its totient is φ = 91296.

The previous prime is 136951. The next prime is 136963. The reversal of 136953 is 359631.

It can be written as a sum of positive squares in only one way, i.e., 131769 + 5184 = 363^2 + 72^2 .

It is not a de Polignac number, because 136953 - 21 = 136951 is a prime.

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

It is a Duffinian number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 136953.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7600 + ... + 7617.

2136953 is an apocalyptic number.

It is an amenable number.

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

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

136953 is an evil number, because the sum of its binary digits is even.

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

The product of its digits is 2430, while the sum is 27.

The square root of 136953 is about 370.0716146910. The cubic root of 136953 is about 51.5454715120.

It can be divided in two parts, 136 and 953, that added together give a square (1089 = 332).

The spelling of 136953 in words is "one hundred thirty-six thousand, nine hundred fifty-three".

Divisors: 1 3 9 15217 45651 136953