2453
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
- 4
- Divisor Sum
- 2688
- Proper Divisor Sum (Aliquot Sum)
- 235
- 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
- 2220
- Möbius Function
- 1
- Radical
- 2453
- 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
- 40
- 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
- Number of points of norm <= n^2 in square lattice.at n=28A000328
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=37A011901
- Expansion of Product_{m>=1} (1+q^m)^(-11).at n=6A022606
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Lucas numbers).at n=14A024368
- a(n) = n^2 + n + 3.at n=49A027688
- Number of partitions of n into parts 4k+1 or 4k+2.at n=41A035365
- Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists.at n=41A036236
- Numbers k such that d(i) is a power of 2 for all k <= i <= k+6, where d(i) = number of divisors of i.at n=39A036540
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) < cn(2,5) = cn(4,5).at n=67A036867
- Numerators of continued fraction convergents to sqrt(307).at n=5A041578
- Denominators of continued fraction convergents to sqrt(313).at n=8A041591
- Denominators of continued fraction convergents to sqrt(411).at n=9A041781
- Numbers whose base-7 representation has exactly 5 runs.at n=2A043620
- Numbers k such that the string 2,5 occurs in the base 9 representation of k but not of k-1.at n=34A044274
- Numbers n such that string 5,3 occurs in the base 10 representation of n but not of n-1.at n=26A044385
- Numbers n such that string 2,5 occurs in the base 9 representation of n but not of n+1.at n=34A044655
- Numbers n such that string 5,3 occurs in the base 10 representation of n but not of n+1.at n=26A044766
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=13A045107
- Maximum length of non-crossing path on n X n square lattice.at n=35A049486
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 6.at n=15A050955