Properties of the Number 90270

Ninety Thousand Two Hundred Seventy

Basics

Value: 90269 → 90270 → 90271

Parity: even

Prime: No

Previous Prime: 90263

Next Prime: 90271

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 17 × 59

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 17, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110000010011110

Octal: 260236

Duodecimal: 442A6

Hexadecimal: 1609e

Square: 8148672900

Square Root: 300.4496630053028

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

The number of tilings of an equilateral triangle of side length n with k lozenges and n² - 2·k unit triangles. Triangle T(n, k) with n >= 1 and 0 <= k <= n*(n + 1)/2, read by rows. A273464

Number of tilings of an equilateral triangle of side length n with unit triangles (of side length 1) and exactly four unit "lozenges" or "diamonds" (also of side length 1). A326369

Dirichlet g.f.: ∏_k>=2 1 / (1 - k^-s)^binomial(k+3,4). A344204

Numbers k such that A(k+1) = A(k) + 3, where A() = A005100() are the deficient numbers. A317046

Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039). A341604

Numbers n such that the number of primes between n² and (n+1)² = the number of primes between n and Reverse(n) (inclusive). A74817

Least number k such that k and k+2 both have exactly 2n divisors, or -1 if no such number exists. A356766

Least positive r such that concatenation k, r, k is prime, where k == 1,3,7 or 9 (mod 10) in increasing order. A90270