7092
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 18018
- Proper Divisor Sum (Aliquot Sum)
- 10926
- 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
- 2352
- Möbius Function
- 0
- Radical
- 1182
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 57
- 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
- Number of Twopins positions.at n=17A005684
- Numbers n such that n is a substring of its square when both are written in base 2.at n=46A018826
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) <= cn(3,5).at n=66A036862
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=25A060732
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 87 ).at n=34A063360
- Smallest multiple of the n-th prime such that every partial sum is a prime, or 0 if no such number exists.at n=44A085042
- Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.at n=25A087644
- (Sum of composites among next n numbers)-(sum of primes among next n numbers).at n=27A094338
- Antidiagonal sums of the square array A096583, in which the n-th diagonal equals the convolution of the n-th row with the antidiagonal sums (this sequence).at n=14A096584
- "Orders" where balanced prime number records (A082080) occur.at n=46A096692
- G.f. satisfies: A(x) = 1/(1 + x*A(x^8)) and also the continued fraction: 1 + x*A(x^9) = [1; 1/x, 1/x^8, 1/x^64, 1/x^512, ..., 1/x^(8^(n-1)), ...].at n=61A101918
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 7 multiples of n-1, n-2, ..., 1, for n>=1.at n=46A113744
- n(k) is the minimum number that require at least k to make Prime[n]+2*Prime[n+k] a prime.at n=47A114264
- Number of different Othello positions at the end of the n-th ply.at n=6A124005
- Number of distinct vertex-magic total labelings on cycle C_n.at n=7A145692
- a(n) = 729*n - 198.at n=9A156772
- Antidiagonal sums of triangle A186084.at n=34A186505
- Number of arrangements of n+2 nonzero numbers x(i) in -4..4 with the sum of x(i)*x(i+1) equal to zero.at n=3A188244
- T(n,k)=Number of arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=24A188249
- Number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=3A188252