9712
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 18848
- Proper Divisor Sum (Aliquot Sum)
- 9136
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4848
- Möbius Function
- 0
- Radical
- 1214
- Omega Function (Ω)
- 5
- 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
- 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
- 47
- 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
- a(n) = n*(19*n - 1)/2.at n=32A022276
- a(1) = 1; a(n) = smallest number such that the concatenation a(1).0^*.a(2).0^*....0^*.a(n) is a perfect cube (where any number of 0's can be inserted between the terms).at n=2A061111
- Diagonal sums of a Delannoy related triangle.at n=6A113140
- 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, 1), (-1, 1, 0), (0, 1, 0), (1, 0, -1), (1, 1, 1)}.at n=7A150620
- Number of 9 X 9 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=3A156399
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 3.at n=6A156432
- a(n) = 512*n - 16.at n=18A157447
- Dispersion of (2*floor(n*sqrt(3))), by antidiagonals.at n=36A191542
- 1/4 the number of (n+1)X3 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=2A209730
- 1/4 the number of (n+1)X4 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=1A209731
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=7A209736
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=8A209736
- Sophie Germain 5-almost primes.at n=11A211162
- Number n such that a2 - n^3 is a triangular number (A000217), where a2 is the least square above n^3.at n=30A233400
- Partial sums of A029940 (Product_{d|n} phi(d)).at n=34A280131
- Number of Dyck paths of semilength n such that the number of peaks is strongly increasing from lower to higher levels and no positive level is peakless.at n=13A288147
- Number of unitary factorizations of Heinz numbers of integer partitions of n. Number of multiset partitions of integer partitions of n with pairwise disjoint blocks.at n=21A305106
- Numbers L such that there is a prime p <= L for which v_p(H_L - 1) > 1, where v_p(x) is the p-adic valuation of x and H_L is the L-th harmonic number.at n=4A335207
- a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.at n=34A335351
- Colombian numbers that are also Bogotá numbers.at n=25A336984