Properties of the Number -46847

Forty-Six Thousand Eight Hundred Forty-Seven

Basics

Value: -46848 → -46847 → -46846

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 79 × 593

Divisors: 1, 79, 593, 46847

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011011011111111

Octal: -133377

Duodecimal: -2313B

Hexadecimal: -b6ff

Square: 2194641409

Square Root: 216.4416780566996

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 non-isomorphic multiset partitions of weight n where each part has a different length. A326026

Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is last string seen. A36901

Numbers n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) A78420

Triangle read by rows: T(0,0)=1; for n>=1 T(n,k) is the numerator of the coefficient of x^k in the characteristic polynomial of the matrix realizing the transformation to Jacobi coordinates for a system of n particles on a line. A223256

Numbers n such that n | 10ⁿ + 9ⁿ + 1. A57295

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 0, 1), (1, 0, 0), (1, 0, 1)}. A151051

Lexicographically earliest sequence of distinct positive integers such that a(n), a(n+1) and the product a(n)*a(n+1) have in common the substring n. A333933