Properties of the Number 4907

Four Thousand Nine Hundred Seven

Basics

Value: 4906 → 4907 → 4908

Parity: odd

Prime: No

Previous Prime: 4903

Next Prime: 4909

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 701

Divisors: 1, 7, 701, 4907

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100101011

Octal: 11453

Duodecimal: 2A0B

Hexadecimal: 132b

Square: 24078649

Square Root: 70.04998215560087

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

Sum of smallest parts of all partitions of n. A46746

a(n) = least k such that the remainder when 9^k is divided by k is n. A127817

Values of n such that L(12) and N(12) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227515

Composite and every divisor (except 1) contains the digit 7. A62676

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P. A225376

a(n) = 100·n² + n. A55438

Sum of primes p with n² < p < (n+1)². A108314

Number of integer partitions of n whose distinct parts are the binary indices of some prime number. A372887

The second of the pair of consecutive integers k and k+1 such that sopfr(k) divides sopfr(k+1), where sopfr(k) is the sum of the prime factors of k, counting multiplicity. A129317

Row sums of triangle A134237. A134238