Properties of the Number -30020

Thirty Thousand Twenty

Basics

Value: -30021 → -30020 → -30019

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 × 19 × 79

Divisors: 1, 2, 4, 5, 10, 19, 20, 38, 76, 79

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111010101000100

Octal: -72504

Duodecimal: -15458

Hexadecimal: -7544

Square: 901200400

Square Root: 173.26280616450836

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

Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0. A71153

a(1) = 1; thereafter, a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any three consecutive digits in the sequence sum up to a prime. A152603

Mixed partitions of n. A2096

Łukasiewicz words that are also valid asynchronic siteswap juggling patterns. A71160

Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit). A71161

Members of 3-cycles of permutation A111273. A113701

a(n) = 1000·n + 20. A157510

"Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t". A284515

a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10. A22315

T(4n,n), where T is the array defined in A026105. A26114