8057
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
- 4
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 1159
- 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
- 6900
- Möbius Function
- 1
- Radical
- 8057
- Omega Function (Ω)
- 2
- 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
- 127
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that Fib(k) == 13 (mod k).at n=37A023178
- Number of dyslexic identity planted planar trees with n+1 nodes and leaves of 2 colors.at n=8A032103
- Generalized Pellian with second term of 6.at n=6A048875
- Number of compositions minus number of partitions: A011782(n) - A000041(n).at n=14A056823
- Positive integer values of n such that 5n^2+11 is a square.at n=6A082651
- Smallest integer at which the value of truncated Mertens function equals 2^n.at n=9A093776
- The first 8 values are predefined, the remaining set to a(n) = 48*prime(n)+n+2.at n=38A129025
- Triangle P, read by rows, where column k of P^2 equals column 0 of P^(2k+2) such that column 0 of P^2 equals column 0 of P shift one place left, with P(0,0)=1.at n=30A135880
- Column 2 of triangle A135880.at n=5A135883
- Triangle, read by rows, equal to R^3, the matrix cube of R = A135894.at n=15A135896
- Triangle, read by rows equal to the matrix product P^-1*R, where P = A135880 and R = A135894; P^-1*R equals triangle P shifted right one column.at n=39A135898
- Numbers k such that tau(k-1) = (tau(k))^2 = tau(k+1), where tau(k) = A000005(k) (number of divisors of k).at n=30A190266
- Numbers n such that a new circle appears in the structure of A211000.at n=45A211021
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having one, three, four, five or six distinct values for every i,j,k<=n.at n=6A211579
- Floor(AGM(n^2, n^3)), where AGM denotes the arithmetic-geometric mean.at n=29A234362
- Maximal term in row n of sequence A240388 when regarded as a triangle.at n=19A244470
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,34).at n=3A250241
- Number of partitions of n^2 into distinct odd parts.at n=11A281489
- Let phi be the one-to-one mapping between binary trees and natural numbers described in the Tychonievich link. Let a(n) = min({phi^{-1}(t)| size(t)=n}); i.e., a(n) is the rank -- starting from 0 -- of the first tree the size of which is n.at n=19A296689
- Number of nX3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.at n=6A297539