10030
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 9410
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3712
- Möbius Function
- 1
- Radical
- 10030
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).at n=35A023080
- a(n+1) = a(n) converted to base 10 from base 6 (written in base 10).at n=9A023387
- Number of partitions satisfying (cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5) and cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5)).at n=52A036817
- Positive numbers having the same set of digits in base 5 and base 10.at n=38A037433
- Differences of A038011.at n=2A038012
- Numbers having three 0's in base 10.at n=20A043491
- Composites whose sum of digits equals number of its prime factors, with multiplicity.at n=37A050689
- Numbers whose sum of digits is 4.at n=38A052218
- Number of simple traceable graphs on n nodes.at n=7A057864
- Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0.at n=33A069523
- Number of unlabeled connected simple graphs on n vertices with no induced subgraphs isomorphic to a P5 or complement of a P5 (P5 = path on 5 vertices.).at n=8A079564
- Let b(0)=1/2, b(n) = b(n-1) + Prime[n]/2; a(n)=b(2*n).at n=45A112039
- Number of combinatorial types of achiral n-dimensional polytopes with n+3 vertices, where a polytope is achiral if one of its geometric realizations has a reflection-symmetry.at n=12A114291
- Triangle T(n,k) = coefficient [x^n] of x^2/(1-(k+1)*x^2-x^3) for row n, and columns k = 0..n, read by rows.at n=64A117724
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=44A136850
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=13A153747
- Sum of cube of digits is sum of digits of cube.at n=37A165551
- a(n) = Sum_{d|n} d^tau(d).at n=9A174937
- Number of ascent sequences of length n with exactly ten descents.at n=1A241880
- Number of ascent sequences of length n with the maximal number of descents.at n=16A241881