2898
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
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 4590
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 792
- Möbius Function
- 0
- Radical
- 966
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 141
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=9A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=9A004967
- a(n) = n*(n+4)*(n+5)/6.at n=23A005586
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=15A007419
- Coordination sequence for E_7 lattice.at n=2A008397
- a(n) = n*(11*n - 1)/2.at n=23A022268
- Expansion of Product_{m>=1} (1+m*q^m)^23.at n=3A022651
- Number of partitions of n into prime power parts (1 excluded).at n=43A023894
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=27A024312
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=26A024875
- a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2*n-1) = 7. Also a(n) = T(2*n-1,n-3), where T is the array defined in A026009.at n=5A026018
- a(n) = binomial(3*n,n) - binomial(3*n,n-3).at n=5A026019
- Numbers k such that k^2 is palindromic in base 13.at n=17A029998
- Every run of digits of n in base 8 has length 2.at n=37A033006
- Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.at n=44A035928
- Denominators of continued fraction convergents to sqrt(320).at n=7A041605
- Numbers n such that string 8,7 occurs in the base 9 representation of n but not of n-1.at n=38A044330
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n-1.at n=30A044430
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n+1.at n=30A044811
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-3)/3.at n=31A048037