606
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1224
- Proper Divisor Sum (Aliquot Sum)
- 618
- 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
- 200
- Möbius Function
- -1
- Radical
- 606
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 43
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Names
- German
- sechshundertsechs· ordinal: sechshundertsechsste
- English
- six hundred six· ordinal: six hundred sixth
- Spanish
- seiscientos seis· ordinal: 606º
- French
- six cent six· ordinal: six cent sixième
- Italian
- seicentosei· ordinal: 606º
- Latin
- sescenti sex· ordinal: 606.
- Portuguese
- seiscentos e seis· ordinal: 606º
Appears in sequences
- Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=15A000044
- Numbers beginning with letter 's' in English.at n=30A000870
- a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.at n=17A001213
- Numbers in which every digit contains at least one loop (version 1).at n=17A001743
- Numbers n such that every digit contains a loop (version 2).at n=52A001744
- Number of series-reduced planted trees with n+9 nodes and 4 internal nodes.at n=10A001860
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=23A002798
- High-temperature series in w = tanh(J/kT) for ferromagnetic susceptibility for the spin-1/2 Ising model on hexagonal lattice.at n=4A002920
- High temperature series for spin-1/2 Ising surface susceptibility on square lattice.at n=4A003493
- Impractical numbers: even abundant numbers (A173490) that are not practical(2) (A007620).at n=29A007621
- Coordination sequence T2 for Zeolite Code AET.at n=17A008008
- Coordination sequence T2 for Zeolite Code APC.at n=17A008033
- Coordination sequence T3 for Zeolite Code DOH.at n=15A008080
- Coordination sequence T1 for Zeolite Code MER.at n=18A008160
- Coordination sequence T7 for Zeolite Code MFS.at n=15A008179
- Coordination sequence T1 for Cordierite.at n=15A008251
- Numbers that do not contain the letter 't'.at n=36A008523
- Expansion of sin(x)/(1-x).at n=6A009551
- Coordination sequence T6 for Zeolite Code DFO.at n=19A009880
- Coordination sequence T4 for Zeolite Code RTH.at n=17A009896