10445
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12540
- Proper Divisor Sum (Aliquot Sum)
- 2095
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8352
- Möbius Function
- 1
- Radical
- 10445
- Omega Function (Ω)
- 2
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of mobiles (circular rooted trees) with n nodes and 3 leaves.at n=24A055341
- a(n+1) = 2a(n)-a([n/2]) starting with a(0)=0 and a(1)=1.at n=16A062178
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=33A096926
- a(n) = Sum_{k + l*m <= n} (k + l*m), with 0 <= k,l,m <= n.at n=17A106846
- 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, 0), (-1, -1, 1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=9A148693
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 84", based on the 5-celled von Neumann neighborhood.at n=41A270106
- Expansion of Sum_{k>=1} (k*(5*k - 3)/2)*x^k/(1 - x^k).at n=56A278947
- a(n)^2 is the least possible value at the root of a binary tree of height n where all nodes hold positive squares and all interior nodes also equal the sum of their two children.at n=12A309167
- Smallest numbers leading in n steps to a term that repeats itself, according to the rule explained in A316650 (and hereunder in the Comment section).at n=41A316678
- Number of broken 2-diamond partitions of n.at n=14A328540
- a(n) is the smallest positive integer m such that 2^n appears as the denominator of a convergent to sqrt(m).at n=17A338308
- a(n) is the smallest positive integer m such that 2^n appears as the denominator of a semiconvergent to sqrt(m).at n=17A338320
- Position of 30^n among 5-smooth numbers A051037.at n=12A372400
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=26A372680
- Triangle read by rows: T(n,k) is the sum of the lengths of the free polyominoes with n cells and length k, n >= 1, k >= 1.at n=49A379638