6142
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9576
- Proper Divisor Sum (Aliquot Sum)
- 3434
- 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
- 2952
- Möbius Function
- -1
- Radical
- 6142
- Omega Function (Ω)
- 3
- 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
- 155
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes.at n=34A000701
- Number of paraffins.at n=23A006001
- Number of parts in all partitions of n into distinct parts.at n=40A015723
- a(n) = n*(9*n - 1)/2.at n=37A022266
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=27A025513
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=29A026047
- Number of partitions of n into an odd number of parts.at n=34A027193
- a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=22A027383
- a(n) = 3*2^n - 2.at n=11A033484
- Sums of 11 distinct powers of 2.at n=22A038462
- a(n)=(s(n)+4)/10, where s(n)=n-th base 10 palindrome that starts with 6.at n=36A043085
- Numbers whose base-4 representation contains exactly two 1's and four 3's.at n=29A045123
- Permutation of N induced by rotating the node 1 (the top node) left in the infinite planar binary tree shown at A065658.at n=28A065661
- Permutation of N induced by rotating the node 2 right in the infinite planar binary tree shown at A065658.at n=46A065662
- Permutation of N induced by rotating the node 5 right in the infinite planar binary tree shown at A065658.at n=46A065668
- Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=22A073603
- Expansion of 1/(1+x^2+2*x^3).at n=35A077963
- Add 1, double, add 1, double, etc.at n=22A083416
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=12A084804
- Duplicate of A033484.at n=11A099018