2255
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3024
- Proper Divisor Sum (Aliquot Sum)
- 769
- 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
- 1600
- Möbius Function
- -1
- Radical
- 2255
- Omega Function (Ω)
- 3
- 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
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = floor(n(n+2)(2n+1)/8).at n=20A002717
- Numbers that are the sum of 8 positive 6th powers.at n=25A003364
- Divisors of 2^20 - 1.at n=28A003529
- Divisors of 2^40 - 1.at n=41A003546
- a(n) = 7*a(n-1) - a(n-2) with a(0) = 0, a(1) = 1.at n=5A004187
- a(n) = floor(Fibonacci(n)/3).at n=20A004696
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=48A004963
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=15A005900
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=28A005993
- Number of factorization patterns of polynomials of degree n over F_4.at n=15A006169
- a(n) = (n+1)*(n^2 +8*n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times.at n=21A008778
- Base 6 expansion uses each positive digit just once.at n=12A023744
- a(n) = n + (n+1)^2.at n=46A028387
- Rectangular array of numbers Fibonacci(m(n+1))/Fibonacci(m), m >= 1, n >= 0, read by downward antidiagonals.at n=32A028412
- Denominator of Bernoulli(2n+2) - Bernoulli(2n).at n=19A029763
- Expansion of Molien series for 4-D extraspecial group 2^{1+2*2}.at n=29A030533
- Integer ratios of Fibonacci numbers F(m)/F(n).at n=41A031121
- Integers that appear as ratios of Fibonacci numbers F(kn)/F(k), but omitting Fibonacci numbers F(n)/F(1) and Lucas numbers F(2n)/F(n).at n=11A031122
- Numbers k such that 71*2^k+1 is prime.at n=13A032385
- Every run of digits of n in base 10 has length 2.at n=22A033008