Properties of the Number -146688

One Hundred Forty-Six Thousand Six Hundred Eighty-Eight

Basics

Value: -146689 → -146688 → -146687

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ⁸ × 3 × 191

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100011110100000000

Octal: -436400

Duodecimal: -70A80

Hexadecimal: -23d00

Square: 21517369344

Square Root: 382.9986945147464

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

Let p = A002145(n) be the n-th prime == 3 (mod 4); a(n) is the multiplicative order of 2+-i modulo p in Gaussian integers. A385165

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-2 1,0 or -1,0. A264299

a(n) = 144·n² - 24·n (n>=1). A305072

Numbers k such that k and k+1 both have the same number of squarefree divisors and powerful divisors. A360904

Primitive terms in A066192: number k such that k is a term of A066192 and k/2 is not. A383428

Number of (n+1) X (6+1) arrays of permutations of 0..n·7+6 with each element having directed index change 0,1 0,-2 1,0 or -1,0. A264298

Number of (4+1)X(n+1) arrays of permutations of 0..n·5+4 with each element having directed index change 0,1 0,-2 1,0 or -1,0. A264303

Numbers of the form p² - 1 where p is a prime of the form 3·k-1 (A003627). A301812

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.