10452
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
- 24
- Divisor Sum
- 26656
- Proper Divisor Sum (Aliquot Sum)
- 16204
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 5226
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 29
- 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
- Positive numbers k such that k and 4*k are anagrams in base 7 (written in base 7).at n=7A023070
- 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 68.at n=25A031566
- Sequence arising in search for Legendre sequences.at n=11A039791
- a(n) is the number of cubes with at most n digits and first digit 1.at n=13A083380
- Number of dissections of a polygon using strictly disjoint diagonals.at n=12A093128
- Indices of primes in sequence defined by A(0) = 31, A(n) = 10*A(n-1) - 9 for n > 0.at n=14A101823
- Twice nonagonal numbers (or twice 9-gonal numbers): a(n) = n*(7*n-5).at n=39A139268
- Number of n X 2 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=18A163685
- Number of binary strings of length n with equal numbers of 0001 and 1010 substrings.at n=15A164163
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=28A173942
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=24A208181
- T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 nXk array.at n=46A219421
- Unchanging value maps: number of 2 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 2 X n array.at n=8A219422
- Smallest k such that the union of {A242033(i): 1 <= i <= k} and {A242034(i): 1 <= i <= k} includes all primes {3, ..., prime(n)}.at n=42A242064
- Smallest k such that the union of {A242033(i): 1 <= i <= k} and {A242034(i): 1 <= i <= k} includes all primes {3, ..., prime(n)}.at n=43A242064
- Padovan like sequence: a(n) = a(n-2) + a(n-3) for n>3, a(1)=2, a(2)=2, a(3)=0.at n=33A276275
- Number of maximal squarefree words of length n over the alphabet {0,1,2}.at n=37A282212
- Number of 6-cycles in the n-Fibonacci cube graph.at n=10A291915
- a(n) = 4*(n - 1)*(16*n - 23) for n >= 1.at n=13A304378
- G.f. A(x) satisfies: A(x) = 1 + x + x^2 + x^3 + x^4 + x^5*A(x)^2.at n=29A307972