1296
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
- 2
Divisibility
- Divisor Count
- 25
- Divisor Sum
- 3751
- Proper Divisor Sum (Aliquot Sum)
- 2455
- 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
- 432
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- yes
- 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
- 26
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of trees on n labeled nodes: n^(n-2) with a(0)=1.at n=6A000272
- Powers of 6: a(n) = 6^n.at n=4A000400
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=27A000423
- n followed by n^2.at n=71A000463
- Number of partially labeled trees with n nodes (5 of which are labeled).at n=1A000526
- Sum of first n cubes; or n-th triangular number squared.at n=8A000537
- Squares that are not the sum of 2 nonzero squares.at n=23A000548
- Fourth powers: a(n) = n^4.at n=6A000583
- Number of forests with n nodes and height at most 4.at n=4A000951
- Jordan-Polya numbers: products of factorial numbers A000142.at n=33A001013
- Number of red-black rooted trees with n-1 internal nodes.at n=13A001131
- Number of degree-n odd permutations of order 2.at n=9A001465
- a(n) = 1^n + 2^n + ... + 8^n.at n=3A001555
- Perfect powers: m^k where m > 0 and k >= 2.at n=45A001597
- Squares and cubes.at n=43A002760
- Values of phi(k) when phi(k) = phi(k+1).at n=12A003275
- 3-smooth numbers: numbers of the form 2^i*3^j with i, j >= 0.at n=42A003586
- Square array read by upwards antidiagonals: T(n,k) = n^k for n >= 0, k >= 0.at n=59A003992
- Sums of distinct nonzero 4th powers.at n=31A003999
- Array read by ascending antidiagonals: A(n, k) = k^n.at n=61A004248