Properties of the Number -9267

Two Hundred Sixty-Seven

Basics

Value: -9268 → -9267 → -9266

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 3089

Divisors: 1, 3, 3089, 9267

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010000110011

Octal: -22063

Duodecimal: -5443

Hexadecimal: -2433

Square: 85877289

Square Root: 96.26525853079085

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

Number of compositions of n such that every part occurs with the same multiplicity. A98504

Numbers n such that the decimal expansions of both n and n² have 2 as smallest digit and 9 as largest digit. A257485

Numbers that are the sum of seven fourth powers in five or more ways. A345571

Numbers that are the sum of seven fourth powers in exactly five ways. A345827

"EGJ" (unordered, element, labeled) transform of 1,3,5,7... A32316

Starting numbers for which the RATS sequence has eventual period 14. A114615

Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once. A64160

Consider a number·as a concatenation of two integers, a and b: x = concat(a,b). Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves. A248134

a(n) is the minimum sum of a nonnegative integer 4-tuple that takes n moves to reach a 0 component, where a move picks two components, subtracts the smaller from the larger, and doubles the smaller. A383586

a(n) = n³ + 6. A84382