4934
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7404
- Proper Divisor Sum (Aliquot Sum)
- 2470
- 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
- 2466
- Möbius Function
- 1
- Radical
- 4934
- Omega Function (Ω)
- 2
- 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
- 134
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Coordination sequence T1 for Zeolite Code RSN.at n=46A009885
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=29A015990
- Number of partitions of n into 6 unordered relatively prime parts.at n=43A023026
- Convolution of natural numbers with (1, p(1), p(2), ... ), where p(k) is the k-th prime.at n=21A023538
- 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 70.at n=2A031568
- Number of factorizations with one level of parentheses indexed by prime signatures. A050336(A025487).at n=51A050337
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=28A065214
- Right-truncatable semiprimes.at n=43A085733
- Two-sided semiprimes: deleting any number of digits at left or at right, but not both, leaves a semiprime.at n=15A086698
- Numbers k such that numerator of Sum_{i=1..k} 1/(prime(i)-1) is prime.at n=52A092063
- Indices of primes in the sequence defined by A(0) = 31, A(n) = 10*A(n-1) + 71 for n > 0.at n=14A101844
- Abs(*+-) n Sequence.at n=35A119518
- Numbers n such that the largest prime < 10^n is a twin prime member.at n=5A128946
- Even numbers n for which phi(n) > phi(n+1).at n=32A161963
- Square array read by antidiagonals (n >= 1, k >= 2): T(n,k) = b(n,k) + b(k-1,n+1), where b(n,k) = ((1 + sqrt(k))^n - (1 - sqrt(k))^n)/(2*sqrt(k)).at n=57A173739
- Square array read by antidiagonals (n >= 1, k >= 2): T(n,k) = b(n,k) + b(k-1,n+1), where b(n,k) = ((1 + sqrt(k))^n - (1 - sqrt(k))^n)/(2*sqrt(k)).at n=63A173739
- Semiprimes s such that both s + 3 and s - 3 are primes.at n=44A176140
- Number of two-sided n-step prudent walks ending on the northeast corner of their box, avoiding more than two consecutive west steps and more than two consecutive south steps.at n=10A178036
- a(n) = Sum_{k=0..n} C(n,k)*sigma(n+k) for n>=1.at n=7A181411
- a(n) = -1 + n + 4*n^2.at n=35A182868