Properties of the Number 61601

Sixty-One Thousand Six Hundred One

Basics

Value: 61600 → 61601 → 61602

Parity: odd

Prime: No

Previous Prime: 61583

Next Prime: 61603

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 229 × 269

Divisors: 1, 229, 269, 61601

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111000010100001

Octal: 170241

Duodecimal: 2B795

Hexadecimal: f0a1

Square: 3794683201

Square Root: 248.1954874690513

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

Hypotenuse C of primitive Pythagorean triangles such that perimeters are Averages of twin prime pairs, q=p+1, a=q²-p², c=q²+p², b=2·p*q, s=a+b+c, s-+1 are primes. A155175

Numbers that cannot be expressed as sum of at most nine repdigits numbers. One may not add two integers with the same repeated digit. A339673

Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n. A224533

Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=3, k=-1 and l=0. A176857

Number of walks within N² (the first quadrant of Z²) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (1, -1), (1, 1)}. A151275

9's complement of n: a(n) = 10^d - 1 - n where d is the number of digits in n. If a is a digit in n replace it with 9 - a. A61601

Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically. A207760