476
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1008
- Proper Divisor Sum (Aliquot Sum)
- 532
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 192
- Möbius Function
- 0
- Radical
- 238
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 35
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Names
- German
- vierhundertsechsundsiebzig· ordinal: vierhundertsechsundsiebzigste
- English
- four hundred seventy-six· ordinal: four hundred seventy-sixth
- Spanish
- cuatrocientos setenta y seis· ordinal: 476º
- French
- quatre cent soixante-seize· ordinal: quatre cent soixante-seizième
- Italian
- quattrocentosettantasei· ordinal: 476º
- Latin
- quadringenti septuaginta sex· ordinal: 476.
- Portuguese
- quatrocentos e setenta e seis· ordinal: 476º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=57A000008
- Number of positive integers <= 2^n of form x^2 + 4 y^2.at n=11A000072
- Restricted permutations.at n=9A000496
- Fermat coefficients.at n=6A000970
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=16A001208
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=53A001301
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=23A001767
- Number of compositions of n into a sum of odd primes.at n=30A002124
- Numbers of the form (p^2 - 1)/120 where p is 1 or prime.at n=23A002381
- 4-dimensional figurate numbers: a(n) = (6*n-2)*binomial(n+2,3)/4.at n=5A002419
- Smallest multiple of n whose digits sum to n.at n=17A002998
- Beginnings of periodic unitary aliquot sequences.at n=38A003062
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=51A003105
- a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.at n=22A003269
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=35A003635
- Expansion of (1 + x - x^5) / (1 - x)^3.at n=26A004120
- a(n) = ceiling(100*log_2(n)).at n=26A004264
- a(n) = floor(n*phi^5), where phi is the golden ratio, A001622.at n=43A004920
- If k appears so do 2k+2 and 3k+3. (duplicates omitted.)at n=52A005660
- Number of shapes of height-balanced AVL trees with n nodes.at n=13A006265