Properties of the Number 4270

Four Thousand Two Hundred Seventy

Basics

Value: 4269 → 4270 → 4271

Parity: even

Prime: No

Previous Prime: 4261

Next Prime: 4271

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 7 × 61

Divisors: 1, 2, 5, 7, 10, 14, 35, 61, 70, 122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000010101110

Octal: 10256

Duodecimal: 257A

Hexadecimal: 10ae

Square: 18232900

Square Root: 65.34523701081817

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 integer partitions of n with no adjacent parts having quotient > 2. A342094

Number of partitions of n that sorted in increasing order contain a part k in position k for some k. A238395

a(n) = n*(7·n - 1)/2. A22264

Primitive pseudoperfect numbers. A6036

Positive integers n such that n¹⁷ + 1 is semiprime (A001358). A104494

T(n, k) = [x^k] ∑_k=0..n Stirling2(n, k)*RisingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n. A129062

Number of (w,x,y) with all terms in {0,...,n} and |w-x| < |x-y| < |y-w|. A212964

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 2, and a(3) = 4. A50052

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 4. A50036

a(n) = a(n-1) + a(m) for n >= 3, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 3. A50068