13194
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28626
- Proper Divisor Sum (Aliquot Sum)
- 15432
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4392
- Möbius Function
- 0
- Radical
- 4398
- Omega Function (Ω)
- 4
- 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
- 32
- 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
- Nonprime numbers k such that k | sigma_3(k) + phi(k)^3.at n=14A055970
- A014486-indices of A083932-trees.at n=35A083934
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=18A096973
- Numbers with no 1's in base 3 & 4 expansions.at n=33A117496
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150124
- A sequence set up on the first 1000 base ten Pi digits: a(n)=a(n-1)+a(n-2)*Floor[Mod[N[Pi*10^(n - 2), 1000], 10]].at n=12A152158
- Number of lines through at least 2 points of a 10 X n grid of points.at n=24A160850
- Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=6A180833
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+2, p + q = k, and p the least such prime >= k/2.at n=25A234955
- Number of (n+1)X(1+1) 0..3 arrays colored with the upper median value of each 2X2 subblock.at n=2A235965
- Number of (n+1)X(3+1) 0..3 arrays colored with the upper median value of each 2X2 subblock.at n=0A235967
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the upper median value of each 2X2 subblock.at n=3A235972
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the upper median value of each 2X2 subblock.at n=5A235972
- Numbers n such that n*2^2203 - 1 is prime.at n=18A265503
- Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11.at n=21A302767
- Positive numbers k such that k and k + 1 are both positive negaFibonacci-Niven numbers (A331085) and -k and -(k + 1) are both negative negaFibonacci-Niven numbers (A331088).at n=27A331092
- Where ones occur in A349085. These correspond to rationals, 0 < p/q < 1, that have a unique solution, p/q = 1/v + 1/w + 1/x + 1/y + 1/z, 0 < v < w < x < y < z.at n=35A349098