9030
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 25344
- Proper Divisor Sum (Aliquot Sum)
- 16314
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2016
- Möbius Function
- -1
- Radical
- 9030
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 39
- 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
- a(n) = 10000*log_10(n) rounded down.at n=7A004228
- a(n) = n*(n+1)*(n+8)/6.at n=35A006503
- a(n) = n*(23*n + 1)/2.at n=28A022281
- a(n) = (d(n)-r(n))/2, where d = A026049 and r is the periodic sequence with fundamental period (1,0,0,1).at n=33A026050
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=46A027575
- a(n) = n*(n + 1)*(3*n + 1).at n=14A027903
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 38.at n=4A031716
- Number of partitions of n into parts 4k+1 or 4k+2.at n=52A035365
- Products of exactly 5 distinct primes.at n=19A046387
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=29A050055
- Numbers that are divisible by exactly 5 different primes.at n=26A051270
- Number of 3-element proper antichains of an n-element set.at n=6A051303
- a(n) = 10*n^2+n.at n=29A055437
- a(n) = smallest k such that k! ends in 2^n, not counting the trailing zeros.at n=19A058885
- Triangle T(n,m) giving number of m-element intersecting antichains on a labeled n-set or n-variable Boolean functions with m nonzero values in the Post class F(7,2), m=0,.., A037952(n).at n=28A059090
- Number of obtuse triangles made from vertices of a regular n-gon.at n=43A060423
- Triangle T(n,k) of k-block ordered tricoverings of an unlabeled n-set (n >= 3, k = 4..2n).at n=6A060492
- Triangle T(n,k) = number of degree-n permutations with k even cycles, k=0..n.at n=38A060523
- (Sum of digits of n)^5 - (sum of digits^5 of n).at n=16A069965
- Smallest number beginning with 9 and having exactly n distinct prime divisors.at n=4A077334