10434
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 11454
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3312
- Möbius Function
- 1
- Radical
- 10434
- 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
- 148
- 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
- Positive numbers k such that k and 4*k are anagrams in base 5 (written in base 5).at n=4A023063
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=34A026054
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 5.at n=13A038636
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=35A060488
- a(n) = Fibonacci(2*n+1) - 2^(n-1).at n=9A061667
- Diagonal sums of triangle A008949.at n=18A079284
- For even n, a(n) = a(n-2) + a(n-1) + 2^(n/2-2), n>2. For odd n, a(n) = a(n-2) + a(n-1).at n=19A079289
- Number of partitions of n into parts each of which is used a different number of times.at n=48A098859
- Eigentriangle generated from A109128, row sums = expansion of {2(exp(x)-1)}.at n=41A144061
- 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, -1, 1), (-1, 1, 1), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150634
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A104455.at n=31A171589
- Expansion of g.f.: 4^n*n!*(1-y)^(n+1)*f(x, y, m), where f(x, y, m) = 2^(m+1)*exp(2^m*t)/((1-y*exp(t))*(1 + (2^(m+1)-1)*exp(2^m*t))), and m = -2.at n=19A171694
- Number of cyclotomic cosets of 13 mod 10^n.at n=36A221855
- Numbers k such that if x = sigma(k) + tau(k) - k then k = sigma(x) + tau(x) - x.at n=12A238226
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} A_k*(x-3)^k.at n=23A246799
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 411", based on the 5-celled von Neumann neighborhood.at n=24A271891
- Consider Post's tag system applied to the word (100)^n; a(n) = length of the longest word in the orbit, or -1 if the orbit is unbounded.at n=52A291795
- G.f. A(x) satisfies: A(x) = (1/(1 - x)) * A(x^2)*A(x^3)*A(x^5)* ... *A(x^prime(k))* ...at n=30A308271
- Number of parts in all partitions of n with largest multiplicity eight.at n=27A320378
- Lesser members of dihedral amicable pairs: numbers (m, k) such that t(m) = t(k) = m + k, where t(k) = sigma(k) + d(k).at n=2A320457