9016
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 11504
- 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
- 3696
- Möbius Function
- 0
- Radical
- 322
- Omega Function (Ω)
- 6
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 140
- 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
- Number of esters with n carbon atoms up to structural isomerism.at n=11A000632
- Number of simple perfect squared rectangles of order n up to symmetry.at n=15A002839
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=28A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=28A004967
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MEL = ZSM-11 Nan[AlnSi96-nO192] starting with a T2 atom.at n=12A019152
- a(n) = A024741(n+3)/6.at n=10A024742
- a(n) = s(n+3)/3, where s is A024961.at n=9A024962
- First terms from generation 1 onwards.at n=12A048456
- Numbers k such that the squarefree part of k equals A062799(k).at n=22A069551
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=30A112660
- A128064 * A001263.at n=41A136535
- First bisection of A061039.at n=46A144448
- a(n) = 4*(4 + 9*n^2 + 15*n).at n=15A144449
- a(n) = ((9 + sqrt(5))^n + (9 - sqrt(5))^n)/2.at n=4A152261
- 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=23A152777
- Smallest sequence which lists the position of digits "8" in the sequence.at n=48A167450
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=6A175356
- Second accumulation array of A185780, by antidiagonals.at n=60A185783
- Triangle read by rows, defined by T(n,k)=binomial(n,k)*|Stirling1(n,k)|, 0<=k<=n.at n=42A187555
- Number of 0..n arrays x(0..4) of 5 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=11A200944