899
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 960
- Proper Divisor Sum (Aliquot Sum)
- 61
- 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
- 840
- Möbius Function
- 1
- Radical
- 899
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 116
- 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
- achthundertneunundneunzig· ordinal: achthundertneunundneunzigste
- English
- eight hundred ninety-nine· ordinal: eight hundred ninety-ninth
- Spanish
- ochocientos noventa y nueve· ordinal: 899º
- French
- huit cent quatre-vingt-dix-neuf· ordinal: huit cent quatre-vingt-dix-neufième
- Italian
- ottocentonovantanove· ordinal: 899º
- Latin
- octingenti nonaginta novem· ordinal: 899.
- Portuguese
- oitocentos e noventa e nove· ordinal: 899º
Appears in sequences
- a(n) = 4*n^2 - 1.at n=15A000466
- Number of partitions of n into prime parts.at n=51A000607
- a(n) = (4*n+1)*(4*n+3).at n=7A001539
- Numbers in which every digit contains at least one loop (version 1).at n=47A001743
- Odd squarefree numbers with an even number of prime factors that have no prime factors greater than 31.at n=45A002557
- Number of (unordered, unlabeled) rooted trimmed trees with n nodes.at n=11A002955
- Number of partitions of n into parts 5k+2 or 5k+3.at n=53A003106
- Numbers that are the sum of 10 positive 7th powers.at n=7A003377
- a(n) = n*(n+2) = (n+1)^2 - 1.at n=29A005563
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=24A005576
- Products of 2 successive primes.at n=9A006094
- Number of factorization patterns of polynomials of degree n over integers.at n=13A006171
- Primitive modest numbers.at n=35A007627
- Coordination sequence T4 for Zeolite Code LTN.at n=21A008143
- Coordination sequence T1 for Zeolite Code MTN.at n=18A008186
- Coordination sequence T1 for Zeolite Code PAU.at n=22A008219
- Composite but smallest prime factor >= 17.at n=22A008367
- Expansion of 1/((1-x)*(1-x^3)*(1-x^5)*(1-x^7)*(1-x^9)).at n=55A008674
- Numbers k such that all terms in the periodic part of the continued fraction for sqrt(k) except the final term are 1.at n=48A010342
- a(n) = floor(n*(n-1)*(n-2)/30).at n=31A011912