10038
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 13002
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2856
- Möbius Function
- 1
- Radical
- 10038
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 65
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of trees with n nodes, 3 of which are labeled.at n=6A000269
- Triangle read by rows: T(n,k) is the number of partially labeled trees with n nodes, k of which are labeled, 0 <= k <= n.at n=48A034799
- Triangle of number of node labeled trees by number of nodes and number of labels.at n=39A034800
- Numbers m such that m^2 ends in 444.at n=40A039685
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5).at n=33A039900
- Triangle T(n,k) of coefficients of Meixner polynomials of degree n, k=0..n.at n=49A060338
- Triangle read by rows: T(n,k) = number of degree-n permutations with k odd cycles, k=0..n, n >= 0.at n=50A060524
- a(n) = A053061(n)/n.at n=37A061082
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=43A062483
- a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.at n=55A066294
- Triangle M(k,n) read by rows: coefficients of Meixner polynomials.at n=26A094368
- Partial sums of A005557.at n=7A115130
- Multiples of 7, k, such that k +/- 1 are twin primes.at n=37A127545
- Sixth column (m=5) of triangle A060524 without zeros.at n=2A131442
- (24n - 1)p(n): traces of partition class polynomials, with a(0) = -1.at n=10A183011
- Records in A185439; record gaps between consecutive emirps.at n=8A185441
- Coefficient array of the second column of the inverse of the Riordan array ((1+(r+1)x)/(1+(r+2)x+rx^2), x/(1+(r+2)x+rx^2)).at n=51A188463
- n*(n+1)*(n+2)*(n+3)*(20*n^2+72*n+43)/360.at n=6A214616
- Numbers n such that n^32+1 and (n+2)^32+1 are both prime.at n=7A217992
- The Wiener index of the graph obtained by applying Mycielski's construction to the cycle graph C(n).at n=35A228320