Properties of the Number 24895

Twenty-Four Thousand Eight Hundred Ninety-Five

Basics

Value: 24894 → 24895 → 24896

Parity: odd

Prime: No

Previous Prime: 24889

Next Prime: 24907

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 13 × 383

Divisors: 1, 5, 13, 65, 383, 1915, 4979, 24895

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110000100111111

Octal: 60477

Duodecimal: 124A7

Hexadecimal: 613f

Square: 619761025

Square Root: 157.78149447891536

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

Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity). A39752

Read (exponents of primes in the factorization of n!) modulo 2 and convert to decimal. A240504

Number of partitions of n such that the number of parts and the greatest part are not coprime. A200792

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 27 ones. A31795

Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k). A64678

Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime. A111064

Let sequence B_n={b_m} be defined by: b₁=prime(n), b₂=prime(n+1); for m>=3, b_m=b_m-2+b_m-1 if b_m-2+b_m-1 is not semiprime, otherwise b_m is the least prime divisor of b_m-2+b_m-1. Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded. A221218

Numbers k such that 5·k - 3 is prime. A24895