10381
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11872
- Proper Divisor Sum (Aliquot Sum)
- 1491
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8892
- Möbius Function
- 1
- Radical
- 10381
- 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
- 104
- 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
- Pseudoprimes to base 39.at n=24A020167
- Expansion of Product_{m>=1} (1 - m*q^m)^7.at n=13A022667
- Positive numbers having the same set of digits in base 8 and base 9.at n=42A037441
- Sum of numbers in n-th upward diagonal of triangle in A079823.at n=40A079824
- a(n) = gcd(f(n), f(n+1)) where f(n) = n^4 + n^2 + 1.at n=38A111002
- Sequence of denominators of the continued fraction derived from the sequence of the numbers of distinct factors of a number (A001221, also called omega(n)).at n=16A112596
- Successively better denominators for estimating base 10 logs of 2, 3, 4, 5, 6, 7, 8 and 9. "Better" is defined by the RMS error of the best numerators for each given denominator.at n=12A119256
- Let S be the set of positive integers that, when written in binary, exist as substrings in the binary representation of n. a(n) = number of partitions of n into parts that are all members of S. Each part may occur any number of times in a partition.at n=49A175359
- Sum of first k numbers in column k of the natural number array A000027; by antidiagonals.at n=20A185787
- Hyper-Wiener index of a benzenoid consisting of a spiral chain of n hexagons (s=1; see the Gutman et al. reference).at n=7A193392
- Total number of parts >= 3 in all partitions of n.at n=26A207033
- Number of nondecreasing -2..2 vectors of length n whose dot product with some other -2..2 vector equals n.at n=19A226334
- a(n) = 2*a(n-1) - 3*a(n-2) + a(n-3), a(0) = 1, a(1) = 0, a(2) = -1.at n=24A233581
- Number of partitions of n such that 2*(greatest part) >= (number of parts).at n=33A237755
- Number of partitions of n having population standard deviation < 2.at n=42A238658
- Number of partitions of n having standard deviation σ <= 2.at n=42A238659
- The broken eggs problem.at n=24A256101
- Number of n X 2 0..1 arrays with every element equal to 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.at n=11A297972
- a(n) is the least exponent k greater than 1 such that prime(n)^k starts and ends in prime(n).at n=27A320775
- Least number of consecutive primes beginning with 2, the sum of which (A007504) is >= 2^n.at n=29A323360