10962
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 28800
- Proper Divisor Sum (Aliquot Sum)
- 17838
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 1218
- Omega Function (Ω)
- 6
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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 Hamiltonian rooted triangulations with n internal nodes and 3 external nodes.at n=5A003122
- Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=20A007435
- Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=20A011796
- a(n) = n*(n+1)*(n+2)/2.at n=27A027480
- a(n) = n*(2*n-1)*(2*n+1).at n=14A035328
- a(n) = Sum_{k=1..n} d(k)*prime(k), where d(k) = A001223.at n=34A064009
- Numbers k such that k+1 is composite and divides 3^k-2^k.at n=24A068410
- Total number of edges in the distinct simple graphs on n nodes.at n=6A086314
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.at n=7A089415
- Diagonal sums of triangle A099573.at n=27A099574
- Triangle, read by rows, where the g.f. of row n, R_n(x), is a polynomial of degree n that satisfies: [x^k] R_{n+1}(x) = [x^k] (1 + x*R_n(x))^(n+1) for k=0..n+1, with R_0(x) = 1.at n=40A108990
- Number of below-diagonal paths from (0,0) to (n,n) using steps (1,0), (0,1) and (2k-1,1), k a positive integer.at n=7A133656
- a(n) = n*(n^2 - 1)/2.at n=28A135503
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only either as two by three or three by two blocks.at n=16A146156
- a(n) = 686*n - 14.at n=15A157363
- Denominators of the fourth row of Akiyama-Tanigawa algorithm leading to Bernoulli numbers A164555(n)/A027642(n).at n=25A193220
- Non-cyclic numbers n such that phi(n)^phi(n) == gcd(n, phi(n)) (mod n), where phi is Euler totient function.at n=32A230919
- a(n) = floor((10*n^3 + 57*n^2 + 102*n + 72) / 72).at n=41A254875
- Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).at n=44A282845
- Number of multisets of exactly n partitions of positive integers into distinct parts with total sum of parts equal to 2n.at n=17A285230