Properties of the Number 22953

Twenty-Two Thousand Nine Hundred Fifty-Three

Basics

Value: 22952 → 22953 → 22954

Parity: odd

Prime: No

Previous Prime: 22943

Next Prime: 22961

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 1093

Divisors: 1, 3, 7, 21, 1093, 3279, 7651, 22953

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100110101001

Octal: 54651

Duodecimal: 11349

Hexadecimal: 59a9

Square: 526840209

Square Root: 151.50247522730444

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

Wieferich numbers (1): n > 1 such that 2^A000010(n) == 1 (mod n²). A77816

a(n) = p² + p + 1 where p runs through the primes. A60800

Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. cosh( sqrt(k) * (exp(x) - 1) ). A357681

Expansion of e.g.f. cosh(sqrt(3) * (exp(x) - 1)). A357615

Numbers m such that m² divides 2^k - 1 for some k, 0 < k <= m. A246503

Numbers k such that the ring of integers of Q(2^1/k) is not Z[2^1/k]. A342390

Index where n first appears in A381658. A381659

The smallest term in A061862 with exactly n distinct partitions into a sum of nonnegative powers of its digits. A388297

Number of distinct values of the sum of 3 products of three 0..n integers. A225260

Numbers n > 1 such that 2^m == 1 (mod n²), where m = A002326((n-1)/2). A265630