Properties of the Number -30253

Thirty Thousand Two Hundred Fifty-Three

Basics

Value: -30254 → -30253 → -30252

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 30253

Divisors: 1, 30253

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011000101101

Octal: -73055

Duodecimal: -15611

Hexadecimal: -762d

Square: 915244009

Square Root: 173.93389548906217

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

a(n) = floor(n*φ²⁰), where φ is the golden ratio, A001622. A4935

Number of semiprimes <= 2ⁿ. A125527

a(n) = a(n-1) + a(n-2) + 1 for n > 1, a(0)=1, a(1)=5. A22319

Define an increasing sequence as follows. Given the first term, called the seed (the seed need not have the property of the remaining terms of the sequence), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 5. A68170

Primes that remain prime through 3 iterations of function f(x) = 5x + 8. A23286

Primes that remain prime through 4 iterations of function f(x) = 9x + 10. A23327

Primes starting and ending with 3. A62333

Primes p such that p-3 and p+3 are divisible by a cube. A89201

Total area of the bounding boxes of all integer partitions of n. A182094

Primes of the form 2n² - 5. A201713