Properties of the Number 3813

Three Thousand Eight Hundred Thirteen

Basics

Value: 3812 → 3813 → 3814

Parity: odd

Prime: No

Previous Prime: 3803

Next Prime: 3821

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 31 × 41

Divisors: 1, 3, 31, 41, 93, 123, 1271, 3813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111011100101

Octal: 7345

Duodecimal: 2259

Hexadecimal: ee5

Square: 14538969

Square Root: 61.74949392505172

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 in which no part occurs just once. A7690

a(n) = n*(4·n-1). A33991

Coordination sequence for "tea" 3D uniform tiling. A299285

Euler transform of negative integers. A73592

A(n,k) is the n-th Rhonda number to base A002808(k), the k-th composite number; square array A(n,k), n>=1, k>=1, read by antidiagonals. A291925

Integers that are Rhonda numbers to base 6. A100969

a(n) = ∑_k=0..n T(n,k), T given by A026780. A26787

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

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) = 1. A50040

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) = 3, and a(3) = 1. A50056