8020
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16884
- Proper Divisor Sum (Aliquot Sum)
- 8864
- 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
- 3200
- Möbius Function
- 0
- Radical
- 4010
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 114
- 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
- Numbers that are the sum of 3 positive 5th powers.at n=37A003348
- Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (2,2).at n=5A005553
- a(n) = n OR n^3 (applied to binary expansions).at n=19A008468
- a(n) = n^3 + n.at n=20A034262
- Number of partitions of n into parts not of the form 13k, 13k+2 or 13k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 5 are greater than 1.at n=39A035950
- Smallest composite that when added to sum of prime factors reaches a prime after n iterations.at n=31A050710
- Numbers k such that k^8 == 1 (mod 9^3).at n=22A056084
- Sum of distinct powers of 20; i.e., numbers with digits in {0,1} base 20; i.e., write n in base 2 and read as if written in base 20.at n=10A063012
- Number of nonisomorphic cyclic subgroups of the group S_n X S_n (where S_n is the symmetric group of degree n).at n=44A063183
- a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).at n=20A071289
- a(n) = 1^n + 3^n + 6^n.at n=5A074508
- a(n) = Sum_{i=1..n} binomial(i+1,2)^5.at n=2A085440
- Numbers k such that k*(k+2) gives the concatenation of two numbers m and m+7.at n=1A116335
- Number of pairs of probabilistically independent subsets in a set composed of n elements.at n=8A121312
- Numbers k such that k^3 divides 3^(k^2) - 1.at n=28A129211
- a(n) = 3*A146085(n) - 2.at n=45A146091
- Number of zig-zag paths from top to bottom of a rectangle of width 12 with n rows.at n=10A153361
- a(n) = 1000*n + 20.at n=7A157510
- a(n) = 729*n + 1.at n=10A158397
- Numbers k such that k^3 divides 9^(k^2) - 1.at n=47A177909