Properties of the Number 79670

Seventy-Nine Thousand Six Hundred Seventy

Basics

Value: 79669 → 79670 → 79671

Parity: even

Prime: No

Previous Prime: 79669

Next Prime: 79687

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 31 × 257

Divisors: 1, 2, 5, 10, 31, 62, 155, 257, 310, 514

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011011100110110

Octal: 233466

Duodecimal: 3A132

Hexadecimal: 13736

Square: 6347308900

Square Root: 282.2587465429548

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

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345434

Numbers k such that [A070080(k), A070081(k), A070082(k)] is an integer Heronian triangle having triangular area. A70148

Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1. A180807

Number of 0..16 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171322

Number of 0..n-1 integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3. A171355

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1. A180813

a(n) = (gcd(2^p-1, Fibonacci(p))-1)/(8p) > 0 where p = n-th prime from A080050. A79670