Properties of the Number -45067

Forty-Five Thousand Sixty-Seven

Basics

Value: -45068 → -45067 → -45066

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 11 × 17 × 241

Divisors: 1, 11, 17, 187, 241, 2651, 4097, 45067

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011000000001011

Octal: -130013

Duodecimal: -220B7

Hexadecimal: -b00b

Square: 2031034489

Square Root: 212.2898961326233

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(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct. A36241

Expansion of (1-x)^-1/(1-2·x-x³). A77852

Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(3,7). A19489

a(n) is the smallest k such that (Z/kZ)* contains C_2n X C_2n as a subgroup, where (Z/kZ)* is the multiplicative group of integers modulo n. A307436

a(n) = T(n,n-3), where T is the array in A026374. A26382

Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(16,36). A22040

a(n) = T(n,n-3), where T is the array in A026386. A26394