499
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 500
- 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
- 498
- Möbius Function
- -1
- Radical
- 499
- 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
- 48
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 95
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- vierhundertneunundneunzig· ordinal: vierhundertneunundneunzigste
- English
- four hundred ninety-nine· ordinal: four hundred ninety-ninth
- Spanish
- cuatrocientos noventa y nueve· ordinal: 499º
- French
- quatre cent quatre-vingt-dix-neuf· ordinal: quatre cent quatre-vingt-dix-neufième
- Italian
- quattrocentonovantanove· ordinal: 499º
- Latin
- quadringenti nonaginta novem· ordinal: 499.
- Portuguese
- quatrocentos e noventa e nove· ordinal: 499º
Appears in sequences
- No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.at n=12A000769
- Primes p of the form 3k+1 such that Sum_{x=1..p} cos(2*Pi*x^3/p) > sqrt(p).at n=23A000921
- Primes with 7 as smallest primitive root.at n=5A001126
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/3.at n=7A001133
- Numbers n such that every digit contains a loop (version 2).at n=49A001744
- Full reptend primes: primes with primitive root 10.at n=34A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=55A001915
- Primes of the form 4*k + 3.at n=49A002145
- Primes of the form 6m + 1.at n=44A002476
- Number of integral points in a certain sequence of open quadrilaterals.at n=35A002578
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=30A003147
- Numbers that are the sum of 4 nonzero 4th powers.at n=23A003338
- Numbers that are the sum of 9 positive 4th powers.at n=53A003343
- Numbers that are the sum of 9 positive 5th powers.at n=19A003354
- Inert rational primes in Q(sqrt(-5)).at n=49A003626
- Primes p == +- 3 (mod 8), or, primes p such that 2 is not a square mod p.at n=48A003629
- Inert rational primes in Q[sqrt(3)].at n=46A003630
- Inert rational primes in Q(sqrt 7), or, 7 is not a square mod p.at n=48A003632
- Numbers of the form 2^j + 3^k, for j and k >= 0.at n=48A004050
- Primes of the form 2^a + 3^b.at n=26A004051