13270
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23904
- Proper Divisor Sum (Aliquot Sum)
- 10634
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5304
- Möbius Function
- -1
- Radical
- 13270
- 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
- 76
- 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) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=37A025193
- Integer part of log(n!)^sqrt(n).at n=11A062453
- Nearest integer to log(n!)^sqrt(n).at n=11A062454
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=36A217164
- Number of length n 0..5 arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=5A244785
- T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=50A244788
- Number of length 6 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=4A244794
- Numbers k such that 3*R_(k+2) + 5*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=26A257026
- Number of North-East lattice paths from (0,0) to (n,n) that bounce off the diagonal y = x to the right exactly once.at n=7A268429
- Sum of the asymmetry degrees of all 00-avoiding binary words of length n.at n=17A275436
- a(n) is the least number k such that the sum of n^2 consecutive primes starting at prime(k) is a square.at n=23A357813