2653
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3040
- Proper Divisor Sum (Aliquot Sum)
- 387
- 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
- 2268
- Möbius Function
- 1
- Radical
- 2653
- 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
- 27
- 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 k! - (k-1)! + (k-2)! - (k-3)! + ... - (-1)^k*1! is prime.at n=15A001272
- Central polygonal numbers: a(n) = n^2 - n + 1.at n=52A002061
- Coordination sequence T7 for Zeolite Code DDR.at n=32A008077
- Positive integers n such that 2^n == 2^7 (mod n).at n=58A015927
- Powers of fifth root of 6 rounded down.at n=22A018129
- Nearest integer to Gamma(n + 3/11)/Gamma(3/11).at n=8A020012
- a(n) = floor(Gamma(n+3/11)/Gamma(3/11)).at n=8A020057
- Pseudoprimes to base 51.at n=17A020179
- Pseudoprimes to base 52.at n=12A020180
- Strong pseudoprimes to base 51.at n=5A020277
- Strong pseudoprimes to base 52.at n=3A020278
- Numbers k such that the continued fraction for sqrt(k) has period 58.at n=4A020397
- a(n) = n*(27*n + 1)/2.at n=14A022285
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=28A024834
- a(n) = T(n,n-2), where T is the array in A026386.at n=48A026393
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 24 ones.at n=19A031792
- Lucky numbers with size of gaps equal to 8 (lower terms).at n=28A031890
- Fractional part of square root of a(n) starts with 5: first term of runs.at n=47A034111
- Numbers n such that fractional part of e^(Pi*sqrt(n)) > 0.99.at n=46A035484
- Number of partitions of n into parts 4k and 4k+1 with at least one part of each type.at n=51A035621