1403
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1488
- Proper Divisor Sum (Aliquot Sum)
- 85
- 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
- 1320
- Möbius Function
- 1
- Radical
- 1403
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=33A001305
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=19A001836
- Number of n-step self-avoiding walks on a Manhattan lattice.at n=12A006744
- Coordination sequence T11 for Zeolite Code MFI.at n=24A008163
- Coordination sequence T5 for Zeolite Code MTT.at n=23A008193
- Composite but smallest prime factor >= 17.at n=50A008367
- Expansion of e.g.f.: exp(arcsin(sinh(x)))=1+x+1/2!*x^2+3/3!*x^3+9/4!*x^4+41/5!*x^5...at n=7A012099
- sinh(arcsin(sinh(x)))=x+3/3!*x^3+41/5!*x^5+1403/7!*x^7+90641/9!*x^9...at n=3A012104
- Numbers k such that the periodic part of the continued fraction for sqrt(k) contains a single 1.at n=43A013648
- a(n) = n^2 + 3*n - 1.at n=36A014209
- Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).at n=12A023080
- Numbers with exactly 5 2's in their ternary expansion.at n=16A023703
- a(n) = position of 3*(n^2) in A000408.at n=23A024800
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=32A026907
- Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.at n=31A026907
- T(2n-1,n-1), T given by A026907.at n=3A026912
- T(n,[ n/2 ]), T given by A026907.at n=7A026914
- Uniquification of A026907.at n=43A026919
- Numbers whose base-3 representation has 4 fewer 0's than 2's.at n=37A031460
- Numbers whose base-9 representation has 2 fewer 0's than 8's.at n=30A031496