Properties of the Number 48907

Forty-Eight Thousand Nine Hundred Seven

Basics

Value: 48906 → 48907 → 48908

Parity: odd

Prime: Yes

Previous Prime: 48889

Next Prime: 48947

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 48907

Divisors: 1, 48907

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111100001011

Octal: 137413

Duodecimal: 24377

Hexadecimal: bf0b

Square: 2391894649

Square Root: 221.14927085568246

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

Primes p such that q-p = 40, where q is the next prime after p. A126721

Expansion of ∑_k>0 (k·x * (1 + (k·x)^k))^k. A360732

a(n) is the smallest prime p such that there is a multiplicative subgroup H of Z/pZ, of odd size and of index 2n, such that for any two cosets H1 and H2 of H, H1 + H2 contains all of (Z/pZ)\0. A282001

Primes of the form kk·k+k+1, where kk is the concatenation of k with itself. A222962

Odd primes p(i) such that 6·p(i+j)²-1 is also prime for j = 0..3. A223935

Least k > 0 such that the nextprime(k·primorial(n)) - k·primorial(n) is composite. A71771

prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8·k))/k) = m with m = 10. A109564

a(n) = |{0 < k < n: (p(k)+1)*p(n) + 1 is prime}|, where p(.) is the partition function (A000041). A238516

Indices of 9-gonal numbers which are also triangular. A48907