Properties of the Number 93370

Ninety-Three Thousand Three Hundred Seventy

Basics

Value: 93369 → 93370 → 93371

Parity: even

Prime: No

Previous Prime: 93337

Next Prime: 93371

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 9337

Divisors: 1, 2, 5, 10, 9337, 18674, 46685, 93370

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110110010111010

Octal: 266272

Duodecimal: 4604A

Hexadecimal: 16cba

Square: 8717956900

Square Root: 305.56505035753025

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

a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such integer exists. A360217

Number of nX2 0..6 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201066

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1. A93370

Number of 7Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically. A209654