Properties of the Number 90086

Ninety Thousand Eighty-Six

Basics

Value: 90085 → 90086 → 90087

Parity: even

Prime: No

Previous Prime: 90073

Next Prime: 90089

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 31 × 1453

Divisors: 1, 2, 31, 62, 1453, 2906, 45043, 90086

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101111111100110

Octal: 257746

Duodecimal: 44172

Hexadecimal: 15fe6

Square: 8115487396

Square Root: 300.1432991089423

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 least integer k >= 0 for which A328578(k) = A257993(A276086(A276086(k))) = n. A328761

a(n) = A108951(n) - A373158(n), where A108951 is fully multiplicative and A373158 is fully additive with a(p) = p# for prime p, where x# is the primorial A034386(x). A373984

Triangle: T(n,k) = number of partitions of n (>=2) with no subsum equal to k (1 <= k <= n-1). A46663

Number of partitions of 2n with all subsums different from n. A6827

Triangle read by rows where T(n,k) is the number of strict integer partitions of n without a subset summing to k. A365663

Smallest pseudoprime to base n, not necessarily exceeding n (cf. A007535). A90086

a(n) = r₄(n² + 1), where r₄(k) is the number of ways of writing k as a sum of 4 squares (A000118). A333173

a(n) = ∑_k=0..n r₄(k² + 1), where r₄(k) is the number of ways of writing k as a sum of 4 squares (A000118). A333174