599
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 600
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 598
- Möbius Function
- -1
- Radical
- 599
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 118
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 109
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- fünfhundertneunundneunzig· ordinal: fünfhundertneunundneunzigste
- English
- five hundred ninety-nine· ordinal: five hundred ninety-ninth
- Spanish
- quinientos noventa y nueve· ordinal: 599º
- French
- cinq cent quatre-vingt-dix-neuf· ordinal: cinq cent quatre-vingt-dix-neufième
- Italian
- cinquecentonovantanove· ordinal: 599º
- Latin
- quingenti nonaginta novem· ordinal: 599.
- Portuguese
- quinhentos e noventa e nove· ordinal: 599º
Appears in sequences
- Number of esters with n carbon atoms up to structural isomerism.at n=8A000632
- Twin primes.at n=51A001097
- Primes with 7 as smallest primitive root.at n=6A001126
- Primes == +-1 (mod 8).at n=50A001132
- Lesser of twin primes.at n=26A001359
- Numbers k such that phi(k+2) = phi(k) + 2.at n=42A001838
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=35A001914
- a(n+6) = -a(n+5) + a(n+4) + 3a(n+3) + a(n+2) - a(n+1) - a(n). a(n) = sign(n) if abs(n)<=3.at n=23A001945
- Prime determinants of forms with class number 2.at n=50A002052
- Primes of the form k^2 - k - 1.at n=15A002327
- Numbers k such that (k^2 + k + 1)/7 is prime.at n=51A002641
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=33A003147
- Inert rational primes in Q(sqrt(-5)).at n=54A003626
- Inert rational primes in Q(sqrt 7), or, 7 is not a square mod p.at n=55A003632
- Divisible only by primes congruent to 4 mod 5.at n=28A004618
- Divisible only by primes congruent to 4 mod 7.at n=19A004622
- Divisible only by primes congruent to 7 mod 8.at n=35A004628
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=24A004978
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.at n=24A004979
- Class 4- primes (for definition see A005109).at n=10A005112