8048
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 15624
- Proper Divisor Sum (Aliquot Sum)
- 7576
- 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
- 4016
- Möbius Function
- 0
- Radical
- 1006
- 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
- 70
- 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
- Expansion of 1/((1-x)^3*(1-x^2)^2*(1-x^3)).at n=21A002625
- Positive numbers having the same set of digits in base 6 and base 9.at n=39A037436
- Smallest x > 0 such that gcd(2^x, A004086(2^x)) = 2^n.at n=12A072033
- a(n) = -Sum_{d|n} (-n/d)^d.at n=25A076717
- Self-convolution of Lucas numbers.at n=13A099924
- Finite sequence of iterations at which Langton's Ant passes through the origin.at n=24A102358
- Least n-bit number whose binary representation's substrings represent the maximal number (A112509(n)) of distinct integers.at n=12A112510
- Number of permutations of order n avoiding the consecutive pattern 12'1'2.at n=8A177473
- Number of partitions p of n such that 2(number of parts of p) - 2*min(p) is a part of p.at n=48A238588
- Numbers equal to the arithmetic derivative of their Euler totient function.at n=28A248815
- 8-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0.at n=21A251672
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood.at n=47A266206
- G.f. A(x) satisfies: A(x) = 1 + x*A(x^2)/(1 - x)^2.at n=33A307889
- a(n)/2^n is the expected length of the longest palindromic subsequence of a length-n binary string.at n=9A320910
- a(1) = 1; a(n+1) = -Sum_{d|n} a(n/d) * a(d).at n=14A325303
- The number of edges inside a cross with width 3 and height n (see Comments in A331455 for definition) formed by the straight line segments mutually connecting all vertices and all points.at n=10A330851
- a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways.at n=31A365294
- The number of lit cells in weakly decreasing partitions of n when light shines from the north west and only the first column is lit. Here partitions are represented from left to right by columns of cells.at n=23A366175