Properties of the Number 136

One Hundred Thirty-Six

Basics

Value: 135 → 136 → 137

Parity: even

Prime: No

Previous Prime: 131

Next Prime: 137

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 17

Divisors: 1, 2, 4, 8, 17, 34, 68, 136

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001000

Octal: 210

Duodecimal: B4

Hexadecimal: 88

Square: 18496

Square Root: 11.661903789690601

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 + ... + n. A217

Coordination sequence T1 for Zeolite Code ABW and ATN. A8000

Numbers that are not squarefree. Numbers that are divisible by a square greater than 1. The complement of A005117. A13929

a(n) = prime(n) - 1. A6093

a(n) = 3·n + 1. A16777

Upper Wythoff sequence (a Beatty sequence): a(n) = floor(n*φ²), where φ = (1+sqrt(5))/2. A1950

Positive integers which are neither squarefree integers nor prime powers. A126706

Triangle read by rows: T(n,k) is the number of compositions of n into nonzero parts with k parts directly followed by a different part, n>=0, 0<=k<=A004523(n-1). A238279

Fibbinary numbers: if n = F(i1) + F(i2) + ... + F(ik) is the Zeckendorf representation of n (i.e., write n in Fibonacci number system) then a(n) = 2^{i1 - 2} + 2^{i2 - 2} + ... + 2^{ik - 2}. Also numbers whose binary representation contains no two adjacent 1's. A3714

Numbers that are the sum of 2 squares. A1481

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.