1899
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2756
- Proper Divisor Sum (Aliquot Sum)
- 857
- 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
- 1260
- Möbius Function
- 0
- Radical
- 633
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire 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
- no
- Odd
- yes
Appears in sequences
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=48A000960
- MacMahon's solid partitions of n in which 2 is the smallest summand.at n=9A002043
- Triangle a(n,k) of number of M-sequences read by antidiagonals.at n=70A007723
- Number of pairs of permutations of degree n that avoid (12,21).at n=5A007767
- Coordination sequence T1 for Zeolite Code AFY.at n=36A008029
- M-sequences from multicomplexes on at most 7 variables with no monomial of degree more than n-1.at n=3A011804
- M-sequences m_0,m_1,m_2,m_3 with m_1 < n.at n=7A011819
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=16A011933
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=76A015931
- Numbers k such that the continued fraction for sqrt(k) has period 26.at n=41A020365
- Coordination sequence T1 for Zeolite Code MWW.at n=29A024986
- a(n) = n^2 + n + 7.at n=43A027692
- Iterate the map in A006368 starting at 8.at n=46A028393
- Convolution of Thue-Morse sequence A001285 with primes.at n=26A029888
- Numbers whose base-10 representation has 2 fewer 0's than 9's.at n=32A031500
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 43.at n=4A031541
- Lucky numbers with size of gaps equal to 16 (lower terms).at n=5A031898
- Numbers k such that 231*2^k+1 is prime.at n=38A032492
- Numbers whose base-14 expansion has no run of digits with length < 2.at n=21A033027
- GCD-convolution of squares A000290 with themselves.at n=52A033457