ℕ atory
Play Now

Properties of the Number 33365

Thirty-Three Thousand Three Hundred Sixty-Five

Basics

Value: 33364 → 33365 → 33366

Parity: odd

Prime: No

Previous Prime: 33359

Next Prime: 33377

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 6673

Divisors: 1, 5, 6673, 33365

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000001001010101

Octal: 101125

Duodecimal: 17385

Hexadecimal: 8255

Square: 1113223225

Square Root: 182.6608879864543

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 tilings of an equilateral triangle of side length n with unit triangles (of side length 1) and exactly three unit "lozenges" or "diamonds" (also of side length 1). A326368
a(n) = T(n,2n-4), T given by A027023. A27028
Number of set partitions of [n] such that 5 is the largest element of the last block. A271744
Number of set partitions of [n+7] such that n is the largest element of the last block. A271758
Numbers k such that k and k2 use only the digits 1, 2, 3, 5 and 6. A136974
Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 15. A51980
a(n) = prime(prime(n·n) - n·n) - n·n where prime(n) is the n-th prime. A141127
Consider the prime factors, with multiplicity, in ascending order, of a composite number not ending in 0. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to the reverse of themselves. A247013
Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)t+u+v) having four, six or seven distinct values for every i,j,k<=n. A211737
a(n) = floor(45/n). A33365