Properties of the Number 7133

Seven Thousand One Hundred Thirty-Three

Basics

Value: 7132 → 7133 → 7134

Parity: odd

Prime: No

Previous Prime: 7129

Next Prime: 7151

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 7 × 1019

Divisors: 1, 7, 1019, 7133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101111011101

Octal: 15735

Duodecimal: 4165

Hexadecimal: 1bdd

Square: 50879689

Square Root: 84.45708969648433

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

Starts of runs of 4 consecutive Gray-code Niven numbers (A344341). A344344

Unary-binary representation of Stern polynomials: a(n) = A156552(A260443(n)). A277020

a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 5's. A254500

E.g.f. satisfies A(x) = exp(x) / (1 - x·A(x))². A377742

Numbers n such that the digits of σ(n) are exactly the same (albeit in different order) as the digits of φ(n), in base 10. A175795

Odd bisection of A277020: a(n) = A277020(2n+1). A277189

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + 2·n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294558

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences. A295367

Numbers k such that 9·k^k - 8 is prime. A302134

Number of partitions of n that do not contain 6 as a part. A27340