13073
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13860
- Proper Divisor Sum (Aliquot Sum)
- 787
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12288
- Möbius Function
- 1
- Radical
- 13073
- 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
- 138
- 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
- no
- Odd
- yes
Appears in sequences
- Crystal ball sequence for 5-dimensional cubic lattice.at n=8A001847
- Crystal ball sequence for 8-dimensional cubic lattice.at n=5A008417
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=68A011905
- Pseudoprimes to base 40.at n=39A020168
- Strong pseudoprimes to base 27.at n=18A020253
- Strong pseudoprimes to base 57.at n=13A020283
- Numbers whose set of base-16 digits is {1,3}.at n=26A032923
- a(n) = n*(8*n^2 - 5)/3.at n=17A063523
- Number of nodes in virtual, "optimal", chordal graphs of diameter 5, degree =n+1.at n=14A067969
- Number triangle, equal to half of Delannoy square array A008288.at n=39A113139
- Riordan array (1/(1-x), x*(1+x)^2/(1-x)^2).at n=49A114123
- G.f.: A(x) = Product_{n>=1} G(x^n,n)^n where G(x,n) = 1 + x*G(x,n)^n.at n=14A134774
- Expansion of 1/(x^k*(1-x-2*x^(k+1))) for k=7.at n=32A143450
- Number triangle T(n,k) = [k<=n]*Hypergeometric2F1([-k, 2k-2n], [1], 2).at n=50A184883
- Number of walks from (0,0) to (n+3,n) which take steps from {E, N, NE}.at n=5A190666
- Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant = 0 (mod 3).at n=12A211033
- Number of (n+2) X 4 0..1 matrices with each 3 X 3 subblock idempotent.at n=15A224553
- Riordan array ((1-x)/(1-2*x), x(1-x)/(1-2*x)^2).at n=49A236471
- Consider a decimal number, n, with k digits. n = d(k)*10^(k-1) + d(k-1)*10^(k-2) + … + d(2)*10 + d_(1). Sequence lists the numbers n that divide s = Sum_{i=1..k} d(i)^d(i).at n=18A243507
- a(n) = n-th pseudoprime to base n.at n=38A247906