Properties of the Number 4113

Four Thousand One Hundred Thirteen

Basics

Value: 4112 → 4113 → 4114

Parity: odd

Prime: No

Previous Prime: 4111

Next Prime: 4127

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 457

Divisors: 1, 3, 9, 457, 1371, 4113

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000010001

Octal: 10021

Duodecimal: 2469

Hexadecimal: 1011

Square: 16916769

Square Root: 64.13267497929586

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 of even rank. A340601

a(1) = 1, a(2n) = 16a(n), a(2n+1) = a(2n)+1. A33052

BII-numbers of chains of nonempty sets. A326703

Number of ways of writing n as the sum of 9 triangular numbers. A226253

Describe all the numbers already used (sorted into increasing order - not splitting numbers up into their digits). A60857

T(n,k)=Number of length n+5 0..k arrays with some disjoint triples in each consecutive six terms having the same sum. A248068

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4. A239986

Concatenation of n-th prime and n in decimal notation. A75110

Stern-Jacobsthal numbers. A101624

Odd positive integers a(n) such that for every integer m == 3 (mod 4) there exists a unique representation of the form m = a(l) + 2·a(s), but there are no such representations for m == 1 (mod 4). A145818