Properties of the Number 19495

Nineteen Thousand Four Hundred Ninety-Five

Basics

Value: 19494 → 19495 → 19496

Parity: odd

Prime: No

Previous Prime: 19489

Next Prime: 19501

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 7 × 557

Divisors: 1, 5, 7, 35, 557, 2785, 3899, 19495

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100110000100111

Octal: 46047

Duodecimal: B347

Hexadecimal: 4c27

Square: 380055025

Square Root: 139.6244964180713

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 integer compositions of n whose leaders of maximal anti-runs are not identical. A374640

Composite numbers k such that k-1 divides 2^k-2. A330382

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} σ( ( n/gcd(x₁, x₂, x₃, n) )² ). A373131

Composite numbers whose prime factors contain no digits other than 5 and 7. A36320

a(n) = 54·n² + 1. A158646

Numbers k such that 7·10^k + 5·R_k - 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A103061

Number of partitions p of n such that max(p) - 3·min(p) is a part of p. A238627

A137576((k-1)/2) for composite numbers k from A141229. A140197

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, 0, 1), (0, 1, -1), (1, -1, -1), (1, 1, 1)}. A149610

Numbers n such that n, p=prime(n) and q=prime(p) have the same sum of digits. A261142