13067
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13320
- Proper Divisor Sum (Aliquot Sum)
- 253
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12816
- Möbius Function
- 1
- Radical
- 13067
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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
- From a Goldbach conjecture: the location of records in A185091.at n=12A002091
- a(n) = number of types of conjugacy classes in GL(n,q) (this is independent of q).at n=12A003606
- Numbers k such that 6!*(2*k-7)!/(k!*(k-1)!) is an integer.at n=13A004786
- Numbers k such that 7!*(2k-8)!/(k!*(k-1)!) is an integer.at n=15A004787
- Base 8 palindromes that start with 3.at n=30A043023
- a(n) is the smallest k such that (k^3 + 1)/(n^3 + 1) is an integer > 1.at n=34A065964
- Start of the first run of a string of exactly n successive integers in A088070.at n=10A088390
- Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are also not larger than 2^n.at n=15A095384
- Pell pseudoprimes: odd composite numbers n such that P(n)-Kronecker(2,n) is divisible by n.at n=20A099011
- G.f.: (1+x^2)/((1-3x)(1-x-x^2)).at n=8A099167
- Odd winning positions in Fibonacci nim.at n=27A120904
- Number of n-node triangulations of the nonorientable surface N_4 in which every node has degree >= 4.at n=2A129054
- 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, 0, 0), (0, -1, 0), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150849
- a(n) = 484*n - 1.at n=26A158330
- a(n) = 12*n^2 - 1.at n=33A158463
- Exponential generating function is (1-x^1/1!)(1-x^2/2!)(1-x^3/3!)....at n=11A185895
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x+289)^2 = y^2.at n=11A207059
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A207265
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=51A207269
- Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=3A207274