10456
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19620
- Proper Divisor Sum (Aliquot Sum)
- 9164
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5224
- Möbius Function
- 0
- Radical
- 2614
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 179
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- E.g.f. exp(tan(x)*sin(x)) (even powers only).at n=4A009250
- E.g.f.: tan(arcsinh(x)*exp(x))=x+2/2!*x^2+4/3!*x^3+24/4!*x^4+180/5!*x^5...at n=7A012587
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=17A014563
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=33A020417
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 25.at n=40A031523
- Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=15A045247
- Expansion of (1-x)/(1 - x - x^2 - 3*x^3 + 3*x^4).at n=16A052915
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) properly contained in the digits of a(n+1)^2, with a(0)=1.at n=8A065297
- Renewal array for central trinomial numbers A002426.at n=58A111960
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=16A166796
- Opmanis's sequence: a(n) is the smallest integer k such that k or one of its nonzero substrings (regarded as an integer) is divisible by every integer in the range 1 through n.at n=14A177834
- a(n) = sum of absolute values of coefficients in (1-x-x^2+x^3)^n.at n=8A192205
- Numbers n such that phi(n') = phi(n)', where phi(n) is the Euler totient function of n and n' is the arithmetic derivative of n.at n=49A260961
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 137", based on the 5-celled von Neumann neighborhood.at n=6A270275
- 2nd term of the continued fraction for 2-sqrt(2)^^n, where x^^n denotes tetration.at n=23A280918
- Numbers that are not the difference of two binary palindromes (A006995).at n=24A290393
- Expansion of 1/(1 - Sum_{k>=1} x^k/(1 - x^(2*k))).at n=13A320650
- Starting at n, a(n) is the number of times we travel to a position already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=20A324674
- Number of binary words of length n with an even number of occurrences of the subword 0101.at n=14A332052
- Starts of runs of 5 consecutive even numbers that are all totient numbers (A002202).at n=40A333022