ℕ atory
Play Now

Properties of the Number 34012

Thirty-Four Thousand Twelve

Basics

Value: 34011 → 34012 → 34013

Parity: even

Prime: No

Previous Prime: 33997

Next Prime: 34019

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 2 × 11 × 773

Divisors: 1, 2, 4, 11, 22, 44, 773, 1546, 3092, 8503

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010011011100

Octal: 102334

Duodecimal: 17824

Hexadecimal: 84dc

Square: 1156816144

Square Root: 184.42342584389868

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

Numbers whose digits are a permutation of [0,...,n] and which contain the product of any two adjacent digits as a substring. A203569
T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00000101. A260001
Lexicographically first sequence of distinct terms such that any set of five successive digits can be reordered as {d, d+1, d+2, d+3, d+4}, d being the smallest of the five digits. A302500
McKay-Thompson series of class 24H for Monster. A58578
Number of 6Xn 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically. A209653
Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300493
a(n) = 10000·log(n) rounded to nearest integer. A4244
Number of n X n 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically. A209645
Number of n X 6 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 0 1 vertically. A209648
Let an integer with k+1 digits as n = d(k)*10k + d(k-1)*10k-1 + ... + d(0)*100 and consider the transform T(n) = k·10d(k) + (k-1)*10d(k-1) + ... + 0·10d(0). a(n) gives the fixed points of the transform T(n). A226767