Properties of the Number 70101

Seventy Thousand One Hundred One

Basics

Value: 70100 → 70101 → 70102

Parity: odd

Prime: No

Previous Prime: 70099

Next Prime: 70111

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7789

Divisors: 1, 3, 9, 7789, 23367, 70101

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001000111010101

Octal: 210725

Duodecimal: 34699

Hexadecimal: 111d5

Square: 4914150201

Square Root: 264.7659343646761

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

Second-order Fibonacci numbers. A10049

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

a(n) = self-convolution of row n of array T given by A027926. A27989

Number of ternary length-2 squarefree words of length n not containing the subwords 021 or 10. A373554

a(n) = T(2n+1,n+3), T given by A026758. A26878

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

Number of obtuse integer triangles with perimeter n. A70101

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