5422
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8136
- Proper Divisor Sum (Aliquot Sum)
- 2714
- 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
- 2710
- Möbius Function
- 1
- Radical
- 5422
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 116
- Smith Number
- yes
- 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
- 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 72.at n=18A031570
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 42 ones.at n=21A031810
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) <= cn(3,5).at n=62A036862
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5) + cn(2,5) and cn(1,5) + cn(4,5) <= cn(0,5) + cn(3,5).at n=37A039864
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = 1, a(2) = 2, and a(3) = 1.at n=12A049951
- Triangle read by rows: number of nonisomorphic semigroups of order n with k idempotents.at n=17A058108
- Number of semigroups of order n with 3 idempotents.at n=3A058111
- Total number of parts in all partitions of n into odd parts.at n=34A067588
- Numbers n occurring in binary representation of n*(n+1)/2.at n=33A092734
- a(n) = floor(11^n/8^n).at n=27A094995
- Trajectory of 1001 under "3x+1" map.at n=26A100709
- Semiprimes with prime sum of decimal digits and prime sum of prime factors.at n=44A108610
- Numbers k such that (k!/k#) * 2^k + 1 is prime, where n# = primorial numbers (A034386).at n=21A108894
- Convolution of large Schroeder numbers and central binomial coefficients.at n=6A110276
- Shadow of N (natural numbers), also of Champernowne's shadow.at n=36A110623
- Sum of parts, counted without multiplicities, in all partitions of n into odd parts.at n=29A116930
- (1/4)*number of nonsquare rectangles with corners on an n X n grid of points.at n=13A122225
- a(n) = number of conjugacy classes in PSL_3(prime(n)).at n=30A124679
- Number of partitions of n such that every part divides the largest part; a(0) = 1.at n=50A130689
- a(1)=1. a(n) = a(n-1) + (sum of the distinct primes that are <= n and don't divide a(n-1)).at n=48A137395