8034
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 9438
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2448
- Möbius Function
- 1
- Radical
- 8034
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=25A016728
- Sums of distinct powers of 6.at n=46A033043
- Sums of 4 distinct powers of 6.at n=8A038480
- Numbers having four 1's in base 6.at n=28A043376
- a(n) = 3*n*(4*n-1).at n=26A062783
- Prime(n^2) +/- n are primes.at n=31A064495
- a(n) = (4^n mod 3^n) mod 2^n.at n=12A064536
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=7A073476
- a(n) is the number of paths from (0,0) to (n,0) using steps of the form (1,2),(1,1),(1,0),(1,-1) or (1,-2) and staying above the x-axis. Also, a(n) is the number of possible combinations of balls on the lawn after n turns, using a Motzkin variation of the (4,2)-case of the tennis ball problem considered by D. Merlini, R. Sprugnoli and M. C. Verri.at n=8A104184
- Numbers with distinct digits appearing in partition of decimal expansion of Pi.at n=20A104819
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level k (1<=k<=n). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=22A121445
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 0), (0, 1, 1), (1, 1, -1)}.at n=7A150509
- Positions of partition numbers in the EKG sequence.at n=31A159032
- Number of possible paths to each node that lies along the edge of a cut 4-nomial tree, that is rooted one unit from the cut.at n=9A166135
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A033321.at n=47A171486
- Number of partitions of n having no parts with multiplicity 4.at n=33A184639
- Number of partitions of n having no parts with multiplicity 9.at n=32A184644
- Number of -6..6 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=10A200179
- Number of nX2 0..7 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=15A201095
- T(n,k) = Number of length n+1 nonnegative integer arrays starting and ending with 0 with adjacent elements differing by no more than k.at n=43A204213