Properties of the Number 7395

Seven Thousand Three Hundred Ninety-Five

Basics

Value: 7394 → 7395 → 7396

Parity: odd

Prime: No

Previous Prime: 7393

Next Prime: 7411

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 17 × 29

Divisors: 1, 3, 5, 15, 17, 29, 51, 85, 87, 145

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1110011100011

Octal: 16343

Duodecimal: 4343

Hexadecimal: 1ce3

Square: 54686025

Square Root: 85.99418584997477

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

a(n) = 4·n² - 1. A466

Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 13 ways. A97102

3 times octagonal numbers: a(n) = 3·n*(3·n-2). A152751

a(n) = (4·n+1)*(4·n+3). A1539

Squarefree integers m > 1 such that if prime p divides m, then the sum of the base p digits of m is at least p. A324315

Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 3 (mod p-1), where s_p(m) is the sum of the base p digits of m. A324405

Positions of 3's in A264977; positions of 6's in A277330. A277713

a(n) = ∑_{k=1..n, gcd(n,k) = 1} k⁴. A53820

a(n) is the smallest number k larger than a(n-1) such that n·d(k)*sopf(k)=σ(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472). A134382

Odd composite numbers k such that cototient(k) - φ(k) = k - 2*φ(k) is an odd prime. A83255