6255
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 4665
- 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
- 3312
- Möbius Function
- 0
- Radical
- 2085
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 111
- 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
- no
- Odd
- yes
Appears in sequences
- Number of segments created by diagonals of n-gon.at n=15A014629
- Convolution of Fibonacci numbers and {F(2), F(3), F(4), ...}.at n=13A023610
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=24A026037
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+3 or 16k-3.at n=52A036021
- Numbers having four 0's in base 5.at n=28A043352
- Number of compositions of n such that two adjacent parts are not equal modulo 3.at n=19A062201
- a(n) is the number of positive integers <= 10^n that are divisible by no prime exceeding 3.at n=42A100752
- Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=18A124141
- Least i such that prime(i)*2^(10^n) - 1 is prime.at n=4A126716
- Numbers expressible in more than one way as 6^x-y^2.at n=11A134989
- Half-sum (or average) of cubes of two distinct odd primes.at n=23A138855
- a(n) = n*(3*n + 4).at n=45A140676
- G.f. satisfies: A(x + A(x)*A(-x)) = x.at n=7A141202
- a(n) = A142590(n)/3.at n=45A142883
- 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, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, 0)}.at n=10A148097
- 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, 0), (-1, -1, 1), (-1, 1, -1), (0, 0, -1), (1, 0, 1)}.at n=9A148546
- 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, 0, 0), (0, -1, 1), (1, 0, -1), (1, 0, 0), (1, 1, 0)}.at n=7A150398
- Integer part of square root of n^5 = A000584(n).at n=32A155013
- Number of permutations of length n which avoid the patterns 4231 and 3124.at n=8A165535
- Number of distinct values of Sum_{i=0..n} x(i)*binomial(n,i), where the x(i) have values in 0..2.at n=13A205537