13392
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 39680
- Proper Divisor Sum (Aliquot Sum)
- 26288
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 186
- Omega Function (Ω)
- 8
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Smallest k such that sigma(x) = k has exactly n solutions.at n=23A007368
- McKay-Thompson series of class 8E for the Monster group.at n=33A029841
- Number of partitions of n into parts not of the form 21k, 21k+9 or 21k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=35A035987
- Number of degree-n odd permutations of order dividing 4.at n=9A061136
- Numbers k such that gcd(d(k^3), d(k)) is not a power of 2.at n=38A069781
- Fourth binomial transform of Fibonacci numbers F(n).at n=6A081574
- Square array of binomial transforms of Fibonacci numbers, read by antidiagonals.at n=61A081576
- Numbers which are sums of two and also sums of three positive cubes.at n=25A085336
- Numbers which are sums of two, three and four cubes.at n=14A085337
- Numbers which are sums of two, three, four and also sums of five cubes.at n=13A085338
- a(1)=1; for n>=2, a(n)=sum(1<=i<=j<=n-1, gcd(a(i),a(j))).at n=13A099050
- Numbers which are the sum of two positive cubes and divisible by 31.at n=23A102658
- a(1) = 1; a(n) is the smallest integer greater than a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 2^n.at n=8A109670
- McKay-Thompson series of class 16b for the Monster group.at n=33A112151
- Second (k=2) triangle of numbers related to totally asymmetric exclusion process (case alpha=1, beta=1).at n=50A115127
- Partial sums of A064059.at n=5A115132
- Triangle read by rows where the n-th row is the first row of M^n, with M the (n+1)-by-(n+1) matrix with (1,3,1,3,1,3,...) on its main diagonal and (3,1,3,1,3,1,...) on its superdiagonal.at n=41A124572
- Expansion of q^(-1) * (phi(-q) / psi(q^4))^2 in powers of q where phi(), psi() are Ramanujan theta functions.at n=66A131124
- McKay-Thompson series of class 8E for the Monster group with a(0) = 4.at n=66A131125
- Number of sequences of length n with terms from {0,1,...,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i or 2i modulo n.at n=6A173500