10782
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23400
- Proper Divisor Sum (Aliquot Sum)
- 12618
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3588
- Möbius Function
- 0
- Radical
- 3594
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=21A000044
- a(n) = [ 2nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=47A025202
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 95 ).at n=33A063368
- For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.at n=56A066286
- Numbers k such that 7*10^k + 8*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A103067
- 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, 0, 1), (-1, 1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149226
- Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.at n=55A164988
- a(1) = 1, and then a(n) is sum of k*a(k) where k<n and k divides n.at n=59A165552
- Riordan array (f(x),x*f(x)) where f(x) is the g.f. of A117641.at n=57A171224
- Number of 0..2 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=11A171308
- Number of 0..n-1 integer arrays v[1..12] of length 12 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..11.at n=2A171363
- a(n) = n*(17*n - 13)/2.at n=36A180232
- Number of partitions p of n such that (number of numbers of the form 3k+2 in p) is a part of p.at n=35A241548
- Numbers k with the property that p = k^2 - 13 and q = k^2 + 13 are consecutive primes.at n=23A248785
- a(n) is the smallest k >= n such that prime(n)*prime(k) - prime(n+k) is a perfect square.at n=18A248923
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 94", based on the 5-celled von Neumann neighborhood.at n=32A270135
- Numbers n such that Bernoulli number B_{n} has denominator 798.at n=45A272138
- a(n) is the number of numbers in the interval [2^(n-1), 2^n-1] that have exactly n divisors.at n=33A300509
- Number of nonnegative integer matrices with 2 distinct columns and any number of distinct nonzero rows with each column sum being n and rows in decreasing lexicographic order.at n=10A331317