10115
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14736
- Proper Divisor Sum (Aliquot Sum)
- 4621
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6528
- Möbius Function
- 0
- Radical
- 595
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(n*phi^14), where phi is the golden ratio, A001622.at n=12A004929
- Number of walks on cubic lattice.at n=34A005570
- Number of paraffins.at n=33A005997
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=42A027419
- Numerator of Sum_{k=1..n} 1/phi(k).at n=26A028415
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049790.at n=30A049791
- Values of e, the lesser key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.at n=35A051892
- Least k for which the integers floor(2k/(m*(m+1))) for m=1,2,...,n are distinct.at n=38A054064
- Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.at n=30A069043
- Fourth column (m=3) of (1,6)-Pascal triangle A096956.at n=33A096957
- a(n) = n^2*(2*n+1).at n=17A099721
- a(n) = a(n-1) + a(n-2) + 3*a(n-3), with a(0) = 1, a(1) = 0, a(2) = 1.at n=15A103143
- Where records occur in A117831.at n=14A118474
- Expansion of g.f.: -x*(1 - 2*x + 6*x^2 - 2*x^3 + x^4)/((1-x)^3*(1+x)^4).at n=33A122576
- a(n) = n*floor(n/2)^2.at n=35A122656
- Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices.at n=12A130748
- Antidiagonal sums of the triangle A120070.at n=32A143785
- 17 times triangular numbers.at n=34A195037
- Number of (w,x,y,z) with all terms in {0,...,n}, w even, and x = y + z.at n=33A212760
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=15A213182