4698
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
- 20
- Divisor Sum
- 10890
- Proper Divisor Sum (Aliquot Sum)
- 6192
- 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
- 1512
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 6
- 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
- 121
- 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
- Aliquot sequence starting at 180.at n=11A008891
- Numbers k such that Fibonacci(k) == -8 (mod k).at n=46A023166
- Coordination sequence T8 for Zeolite Code MWW.at n=46A024993
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (odd natural numbers).at n=17A025093
- Positive numbers k such that (k+1)*(k+2)*(k+3)*(k+4)/(k+(k+1)+(k+2)+(k+3)+(k+4)) is an integer.at n=15A032795
- Numbers whose base-4 representation contains exactly three 1's and three 2's.at n=24A045103
- Starting positions of strings of 2 0's in the decimal expansion of Pi.at n=33A050201
- The second of the three sequences associated with the polynomial x^3 - 2.at n=12A052102
- First multiple of n whose reverse is also divisible by n, or 0 if no such multiple exists.at n=53A062567
- Least k such that k*11^n +/- 1 are twin primes.at n=19A064220
- Numbers n such that phi(n+1) = 3*phi(n).at n=24A067143
- a(n) = 6*n^2 + 12*n.at n=26A067726
- a(n) = n*(6*n^2 - 7*n + 3)/2.at n=12A071230
- Numbers k such that the difference d of the largest and smallest prime factors of k is a composite divisor of k.at n=37A083264
- Expansion of (1 - 5*x - 2*x^2) / ((1 - x)*(1 + 2*x)*(1 - 6*x)).at n=6A091054
- A Chebyshev transform of the Pell numbers.at n=15A100048
- Numbers that have exactly six prime factors counted with multiplicity (A046306) whose digit reversal is different and also has 6 prime factors (with multiplicity).at n=6A109026
- Number of solutions to +-p(1)+-p(2)+-...+-p(2n)=1 where p(i) is the i-th prime.at n=9A113040
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2 starting at an odd level (0<=k<=floor(n/2)-1 for n>=2; k=0 for n=0,1).at n=29A114463
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns starting at level 0 (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=38A121585