13422
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26856
- Proper Divisor Sum (Aliquot Sum)
- 13434
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4472
- Möbius Function
- -1
- Radical
- 13422
- 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
- 94
- 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
- a(n) = floor(n(n-1)(n-2)(n-3)/19).at n=24A011929
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.at n=39A057534
- Numbers which are the sum of their proper divisors containing the digit 7.at n=12A059466
- Consider numbers of the form ...53197531975319753, whose digits read from the right are 3,5,7,9,1,3,5,7,9,1,3,... Sequence gives lengths of these numbers that are primes.at n=5A090744
- Similar to A072921 but starting with 3.at n=44A152232
- Number of nX5 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=5A200774
- Number of nX6 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=4A200775
- T(n,k)=Number of nXk 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=49A200777
- T(n,k)=Number of nXk 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=50A200777
- Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, six or eight distinct values for every i,j,k<=n.at n=4A211749
- Smallest m such that A070965(m) = n.at n=28A227953
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=29A228963
- Number of meanders of length n with Motzkin-steps avoiding the consecutive steps UD, HH and DU.at n=15A329665
- Zumkeller numbers k (A083207) such that the next Zumkeller number is k + 12.at n=36A345704
- Number of fixed polyarcs with n cells.at n=5A349101
- a(n) = [x^(n^2)] Product_{k=1..n} (x^(k^2) + 1 + 1/x^(k^2)).at n=15A369434
- a(n) is the first position where the digits of n occur simultaneously in the decimal expansions of Pi and e.at n=10A381980