Properties of the Number 30101

Thirty Thousand One Hundred One

Basics

Value: 30100 → 30101 → 30102

Parity: odd

Prime: No

Previous Prime: 30097

Next Prime: 30103

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 31 × 971

Divisors: 1, 31, 971, 30101

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111010110010101

Octal: 72625

Duodecimal: 15505

Hexadecimal: 7595

Square: 906070201

Square Root: 173.49639765712718

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

Irregular triangle read by rows: row n lists the strings of the MIU formal system at the n-th level of the tree generated by recursively applying the system rules, starting from the MI string (see comments and example). A368946

Irregular triangle read by rows: row n lists all of the distinct derivable strings in the MIU formal system that are n characters long. A369173

Ł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

Semiprimes in A056108. A113527

a(1) = 1; a(n+1) is the smallest number > a(n) which differs from it at every digit. A68860

Irregular triangle read by rows: row n lists (in lexicographical order and with duplicates removed) the strings of the MIU formal system at the n-th level of the tree generated by recursively applying the system rules, starting from the MI string. A368953

Greater of number pair whose squares are reversals of each other, with no leading zeros allowed. A106324

Number of conjugacy classes for a non-abelian group of order p³, where p is prime: a(n) = p² + p - 1 where p = prime(n). A319597

T(n,k) is the k-th partition of n in graded reverse lexicographic ordering (A080577) encoded as concatenation of parts which are represented in (zeroless) bijective base-9 numeration (A052382) and separated by zeros; triangle T(n,k), n >= 0, 1 <= k <= A000041(n), read by rows. A332567

The sequence alternates even and odd integers but also even and odd digits; it is monotonically increasing and a(n) is always the smallest integer fitting the pattern. A137667