Properties of the Number -46457

Forty-Six Thousand Four Hundred Fifty-Seven

Basics

Value: -46458 → -46457 → -46456

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 46457

Divisors: 1, 46457

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011010101111001

Octal: -132571

Duodecimal: -22A75

Hexadecimal: -b579

Square: 2158252849

Square Root: 215.5388596054085

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

Primes p such that p² divides 20^p-1 - 1. A242982

Denominators of upper primes-only best approximates (POBAs) to π; see Comments. A265811

Primes that have two terms in their Zeckendorf representation. A182569

a(n) = prime(n) + Fibonacci(n). A4397

Primes that are the sum of two Fibonacci numbers. A178576

Number of n-length ternary words avoiding runs of zeros of length 1 (mod 3). A255630

Number of (w,x,y,z) with all terms in {1,...,n} and w·x>=3·y*z. A211919

If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms. A38868

Primes of the form 9·k⁴ - 204·k³ + 1777·k² - 7038·k + 10729, for k >= 0, listed by increasing k. A117090

Row sums of the inverse of the triangle A(n,k) = 1/F(n+1) if k <= n <= 2k, 0 otherwise. A127712