2388
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5600
- Proper Divisor Sum (Aliquot Sum)
- 3212
- 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
- 1194
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 27
- 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
- Smallest number requiring n chisel strokes for its representation in Roman numerals.at n=26A002964
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=12A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=12A004946
- Number of ternary squarefree words of length n.at n=20A006156
- Number of 3-connected graphs with n nodes.at n=4A006290
- Numbers k such that k^64 + 1 is prime.at n=24A006316
- Coordination sequence T3 for Zeolite Code FER.at n=30A008108
- Coordination sequence T3 for Zeolite Code STI.at n=33A008236
- Triangle read by rows: number of P-graphs by number of edges and number of non-root nodes.at n=43A011268
- a(n) = floor(n*(n - 1)*(n - 2)/31).at n=43A011913
- a(n) = Sum_{i,j,k in Z and i^2 + j^2 + k^2 <= n} i^2 + j^2 + k^2.at n=16A014203
- Numbers n such that n | 11^n + 11.at n=15A015903
- Pseudoprimes to base 61.at n=27A020189
- Expansion of 1/((1-x)*(1-2*x)*(1-6*x)*(1-9*x)).at n=3A021194
- a(n) = Sum_{k=1..n} floor((n/k)*floor(n/k)).at n=38A024921
- Convolution of Thue-Morse sequence A001285 with primes.at n=29A029888
- 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 32.at n=13A031530
- Number of partitions of n into parts 6k+1 or 6k+2.at n=55A035380
- Triangle of B-analogs of Stirling numbers of the second kind.at n=52A039755
- Triangle of B-analogs of Stirling numbers of 2nd kind.at n=47A039756