9054
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19656
- Proper Divisor Sum (Aliquot Sum)
- 10602
- 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
- 3012
- Möbius Function
- 0
- Radical
- 3018
- Omega Function (Ω)
- 4
- 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
- 39
- 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 n-node rooted trees of height at most 3.at n=17A001383
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CAS = Cesium Aluminosilicate (Araki) Cs4[Al4Si20O48] starting with a T2 atom.at n=12A019089
- Numbers k such that k^2 is palindromic in base 5.at n=16A029988
- a(n) = |{m : multiplicative order of 8 mod m = n}|.at n=27A059890
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=13A065903
- Interprimes which are of the form s*prime, s=18.at n=23A075293
- Multiples of 3018.at n=2A086746
- Equals the self-convolution of A089470 and also the hyperbinomial transform of A089470.at n=5A089471
- The two digits touching the first comma have as absolute difference 0. The next such difference is 1. The next one is 2. Then 3, 4, 5... etc. When we reach 9 the differences start a new cycle: 0, 1, 2, 3... etc. Among many such possible sequences, this is the slowest increasing one starting with "1".at n=45A098795
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=37A113537
- G.f. satisfies: A(x) = C(x)*A(x^3*C(x)^4), where C(x) is the g.f. of the Catalan numbers (A000108).at n=9A120900
- Matrix cube of triangle A121412.at n=15A121420
- Column 0 of triangle A121420.at n=5A121421
- Rectangular table, read by antidiagonals, where row n is equal to column 0 of matrix power A121412^(n+1) for n>=0.at n=33A121424
- Number of subpartitions of partition P=[0,1,1,2,2,2,3,3,3,3,4,...] (A003056).at n=17A121430
- Square array, read by antidiagonals, where T(n,k) = T(n,k-1) + T(n-1,k+n) for n>0, k>0, such that T(n,0) = T(n-1,n) for n>0 with T(0,k)=1 for k>=0.at n=30A136733
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150615
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k 0's in the top row A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=48A181330
- Numbers n such that d(n-2) = d(n) = d(n+2) = 12 where d(n)=A000005(n).at n=8A190645
- Smallest k such that A002522(k) and A002522(k+2n) are successive primes of the form m^2+1.at n=32A245463