10315
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12384
- Proper Divisor Sum (Aliquot Sum)
- 2069
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8248
- Möbius Function
- 1
- Radical
- 10315
- 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
- 29
- 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
- 5-digit terms in the continued fraction for Pi.at n=31A048960
- Number of functions f:{0,1,2,...,n} -> {0,1,2,...,n} that satisfy f(0)=0 and f(n)=0, with f nowhere concave upward.at n=12A068602
- List of codewords in binary lexicode with Hamming distance 5 written as decimal numbers.at n=32A075931
- Basis for code in A075931.at n=5A075932
- a(n) = (4^n - 2^n)/2 + 3^n.at n=7A094375
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=19A164766
- E.g.f. A(x) satisfies: A(x) = exp(1+x - exp(x)) * exp( Integral C(x) dx ) such that C(x) = exp( Integral A(x) dx ), where the constant of integration is zero.at n=8A268171
- Number of n element multisets of the 10th roots of unity with zero sum.at n=34A321416
- G.f. A(x) satisfies: A(x) = 1 / (1 - x * Product_{k>=1} A(x^k)).at n=9A329802
- The index of prime(n) in A337182.at n=22A338222
- G.f. satisfies A(x) = (1 + x)^2 + x*A(x)^4.at n=5A366698