10192
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
- 30
- Divisor Sum
- 24738
- Proper Divisor Sum (Aliquot Sum)
- 14546
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 182
- Omega Function (Ω)
- 7
- 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
- 60
- 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
- Fibonacci sequence beginning 6, 13.at n=15A022388
- Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic.at n=23A032091
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=6A033977
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= n/3.at n=20A047200
- a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=3A047899
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n+1)/3.at n=20A048045
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n+2)/3.at n=20A048078
- (Terms in A029665)/2.at n=41A051425
- (Terms in A029643)/2.at n=38A051469
- a(1) = 5, a(n) = sigma(a(n-1)).at n=9A051572
- Product J_3(i), i=1..n.at n=3A059382
- a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.at n=53A066294
- First column of the array A092077 ((8,2)-Stirling2).at n=2A091546
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=33A091854
- Generalized Stirling2 array (8,2).at n=4A092077
- Coefficients arising in combinatorial field theory.at n=4A094072
- Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)].at n=17A095013
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^3-M)/2, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=30A096034
- Least k such that S(k) = S(k+n), or 0 if there is no k, where S is the Kempner function A002034.at n=47A099143
- a(n) = n*(n+1)*(n+2)*(n+4)*(n+23)/120.at n=11A101855