Properties of the Number -456789

Four Hundred Fifty-Six Thousand Seven Hundred Eighty-Nine

Basics

Value: -456790 → -456789 → -456788

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 39

Digital Root: 3

Palindrome: No

Factorization: 3 × 43 × 3541

Divisors: 1, 3, 43, 129, 3541, 10623, 152263, 456789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1101111100001010101

Octal: -1574125

Duodecimal: -1A0419

Hexadecimal: -6f855

Square: 208656190521

Square Root: 675.8616722377442

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

Minimum number n, not already present, that permits the cyclic repetition of the decimal digits 1,2,3,4,5,6,7,8,9 in the sequence. A165307

Numbers with digits in ascending order that differ exactly by 1. A138141

Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9. A59043

Smallest number with n = sum of distinct digits in decimal representation, cf. A217928. A227378

Numbers m with decimal expansion (d_k, ..., d₁) such that d_i = m·i mod 10 for i = 1..k. A344748

a(n) = (10ⁿ-1)*(91/81)-n·10ⁿ/9. A64616

Triangle T(n,k) read by rows: Substring of k digits of sequence A007376, ending at position n, 1 <= k <= n. A224841

a(n) = ∑_{k = 0 to n-1} ( subtract k modulo 9 from 9, multiply this by k-th power of 10 ). A133486

Square array A(m,n) = concatenation of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals. A285807