Properties of the Number 34902

Thirty-Four Thousand Nine Hundred Two

Basics

Value: 34901 → 34902 → 34903

Parity: even

Prime: No

Previous Prime: 34897

Next Prime: 34913

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 277

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000100001010110

Octal: 104126

Duodecimal: 18246

Hexadecimal: 8856

Square: 1218149604

Square Root: 186.82076972328318

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

Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence. A100188

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0. A267562

Number of oriented colorings of the tetrahedral facets (or vertices) of a regular 4-dimensional simplex using n or fewer colors. A337895

Numbers k which have a factorization k = f1·f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once. A370970

Number of partitions p of n such that floor(mean(p)) is a part and ceiling(mean(p)) is not. A241342

Expansion of ∑_k>0 x^2·k/(1+x^k)⁶. A363614

Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2·n. A384968

Numbers k which use half of the ten digits such that they have at least one factorization k=p·q that uses remaining half of the digits that are not in k. A195814

Numbers n = p·q, where n, p, and q together contain all 10 digits at least once. A253172

Diagonal sums of the Riordan array A116382. A116384