Properties of the Number 3065

Three Thousand Sixty-Five

Basics

Value: 3064 → 3065 → 3066

Parity: odd

Prime: No

Previous Prime: 3061

Next Prime: 3067

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 613

Divisors: 1, 5, 613, 3065

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101111111001

Octal: 5771

Duodecimal: 1935

Hexadecimal: bf9

Square: 9394225

Square Root: 55.362442142665635

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

Number of partitions of n into divisors of n. A18818

a(n) = ∑_{i=1..n, j=1..n, gcd(i,j)=1} (n+1-i)*(n+1-j). A115004

Coordination sequence for "cab" 3D uniform tiling formed from octahedra and truncated cubes. A299266

a(2·n) = 9·2ⁿ - 7, a(2·n+1) = 3·2ⁿ⁺² - 7. A354789

Numbers n such that binomial(2n, n) - 1 is prime. A66726

Number of ways to place non-crossing diagonals in convex (n+4)-gon so as to create no triangles or quadrilaterals. A54514

Numbers that contain the product of any two adjacent digits as a substring, and have at least one pair of adjacent digits > 1. A203566

Number of "ON" cells after n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition). A160117

T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals. A269656

Number of 4-almost primes f such that 2ⁿ < f <= 2ⁿ⁺¹. A120035