403
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 448
- Proper Divisor Sum (Aliquot Sum)
- 45
- 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
- 360
- Möbius Function
- 1
- Radical
- 403
- 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
- 19
- Smith 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
Names
- German
- vierhundertdrei· ordinal: vierhundertdreiste
- English
- four hundred three· ordinal: four hundred third
- Spanish
- cuatrocientos tres· ordinal: 403º
- French
- quatre cent trois· ordinal: quatre cent troisième
- Italian
- quattrocentotre· ordinal: 403º
- Latin
- quadringenti tres· ordinal: 403.
- Portuguese
- quatrocentos e três· ordinal: 403º
Appears in sequences
- a(n) = floor(e^n).at n=6A000149
- Nearest integer to e^n.at n=6A000227
- Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2.at n=13A000566
- Numbers k such that (1,k) is "good".at n=10A000696
- Numbers beginning with letter 'f' in English.at n=27A000867
- Number of sublattices of index n in generic 3-dimensional lattice.at n=14A001001
- Number of ways of making change for n cents using coins of 1, 2, 4, 12, 24, 48, 96, 120 cents (based on English coinage of 1939).at n=48A001364
- Number of ways of making change for n cents using coins of 1, 2, 4, 12, 24, 48, 96, 120 cents (based on English coinage of 1939).at n=49A001364
- Expansion of 1/(1-x)^2/(1-x^2)/(1-x^6)/(1-x^12)/(1-x^24)/(1-x^48)/(1-x^60).at n=24A001365
- A Fielder sequence.at n=8A001649
- a(1) = 0, a(2) = -2; for n > 2, a(n) + a(n-2) - a(n-3) - a(n-5) - ... - a(n-p) = (-1)^(n+1)*n if n is prime, otherwise = 0, where p = largest prime < n.at n=30A002120
- Odd squarefree numbers with an even number of prime factors that have no prime factors greater than 31.at n=37A002557
- Expansion of 1/((1-x)^3 (1-x^2)^2 (1-x^3) (1-x^4)).at n=9A002626
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=22A002644
- Negated discriminants of orders of imaginary quadratic fields with 1 class per genus (a finite sequence).at n=58A003171
- Numbers that are the sum of 8 positive 4th powers.at n=38A003342
- Numbers that are the sum of 6 positive 5th powers.at n=12A003351
- Discriminants of the known imaginary quadratic fields with 1 class per genus (a finite sequence).at n=35A003644
- Inverse Möbius transform of A003961; a(n) = sigma(A003961(n)), where A003961 shifts the prime factorization of n one step towards the larger primes.at n=35A003973
- Sum of remainders of n mod k, for k = 1, 2, 3, ..., n.at n=46A004125