Properties of the Number 48947

Forty-Eight Thousand Nine Hundred Forty-Seven

Basics

Value: 48946 → 48947 → 48948

Parity: odd

Prime: Yes

Previous Prime: 48907

Next Prime: 48953

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 48947

Divisors: 1, 48947

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011111100110011

Octal: 137463

Duodecimal: 243AB

Hexadecimal: bf33

Square: 2395808809

Square Root: 221.23968902527412

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 p² divides 17^p-1 - 1. A128668

Primes p such that p is the largest member of a Wieferich tuple. A297846

Sum of the prime parts in the partitions of n into 6 parts. A309467

Prime numbers p not of the form 10·k+1 for which the quintic polynomial x⁵-x-1 modulus p is factorizable into five binomials. A135845

Row sums of A371783 and A371954 (k-quanimous partitions). A372121

Primes p such that p⁵ - 1 has 8 divisors. A341665

Primes p from A031924 such that A052180(primepi(p)) = 31. A52237

Smallest b > 1 such that the first n primes p (i.e., A000040(1)-A000040(n)) all satisfy b^p-1 == 1 (mod p²), i.e., smallest base b larger than 1 such that any member of the set of first n primes is a base-b Wieferich prime. A256236

Let b(n) be the terms of A046528. Then σ(b(n))=2^a(n), where σ=A000203 is the sum of divisors function. A48947

Smallest Wieferich prime (> sqrt(n)) in base n. A247072