1301
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1302
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1300
- Möbius Function
- -1
- Radical
- 1301
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 26
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 212
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of trees with n unlabeled nodes.at n=13A000055
- a(n) = ceiling(n^2/2).at n=51A000982
- Lesser of twin primes.at n=44A001359
- a(n) = a(n-2) + a(n-5).at n=40A001687
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=25A001844
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=55A003147
- Numbers that are the sum of 5 positive 5th powers.at n=27A003350
- a(n) = 1000*log_10(n) rounded down.at n=19A004225
- a(n) = 1000*log_10(n) rounded to the nearest integer.at n=19A004226
- Divisible only by primes congruent to 6 mod 7.at n=39A004624
- Primes written in base 4.at n=29A004678
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=34A005529
- Primes of the form k^2 + k + 41.at n=35A005846
- 3 up, 3 down, 3 up, ... permutations of length 3n+1.at n=2A005982
- Diagonals of Pascal's triangle mod 2 interpreted as binary numbers.at n=21A006921
- Primes with both 10 and -10 as primitive root.at n=41A007349
- Prime triples: p; p+2 or p+4; p+6 all prime.at n=34A007529
- Integers written in factorial base.at n=43A007623
- Reflectable emirps.at n=8A007628
- Number of pebbling configurations with n pebbles.at n=10A007902