9032
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16950
- Proper Divisor Sum (Aliquot Sum)
- 7918
- 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
- 4512
- Möbius Function
- 0
- Radical
- 2258
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- 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 unrooted triangulations with reflection symmetry of a quadrilateral with n internal nodes.at n=9A005505
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 47.at n=24A031545
- Number of partitions into at most a(1) copies of 1, a(2) copies of 2, ...at n=46A052337
- Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes.at n=22A059677
- Even numbers n such that n^2 is an arithmetic number.at n=39A107924
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=36A116721
- INVERT transform of the rabbit sequence, A005614.at n=18A144023
- 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, 0, 1), (0, 1, 1), (1, -1, 1), (1, 1, 0)}.at n=7A150582
- a(n) = 7^n - 6^n + 1.at n=5A155650
- Half the difference between the larger and smaller term of the n-th amicable pair.at n=20A162884
- Array T(n,k) read by antidiagonals: T(n,k) is the number of [n,k]-triangulations in the plane that have reflection symmetry, n >= 0, k >= 0.at n=64A169809
- Sum of n and floor of each previous term divided by its distance from n.at n=17A180086
- Number of length 2+2 0..n arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=10A253130
- Integers n such that either 2^n * prime(n) + 3 or 2^n * prime(n) - 3 is prime.at n=53A265126
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 195", based on the 5-celled von Neumann neighborhood.at n=23A270691
- Half the difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933.at n=20A275470
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A294555
- Total number of 1's in all (binary) max-heaps on n elements from the set {0,1}.at n=16A309052
- Number of strict integer partitions of the n-th prime into a prime number of prime parts.at n=55A316185
- a(n) = [x^n] (4*x^2 + x - 1)/(2*x^2 + 3*x - 1).at n=8A322940