5113
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5114
- 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
- 5112
- Möbius Function
- -1
- Radical
- 5113
- 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
- 134
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 684
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.at n=15A001215
- a(n) is the smallest prime p such that each of the first n primes has three cube roots mod p.at n=3A002225
- Primes of form k^2 + k + 1.at n=24A002383
- Primes of form (p^x - 1)/(p^y - 1), p prime.at n=15A003424
- Balanced primes (of order one): primes which are the average of the previous prime and the following prime.at n=41A006562
- Where the prime race among 7k+1, ..., 7k+6 changes leader.at n=37A007354
- Number of partitions of n into parts >= 4.at n=54A008484
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=50A011905
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=35A014755
- Primes that are palindromic in base 2 (but written here in base 10).at n=19A016041
- Numbers k such that the continued fraction for sqrt(k) has period 79.at n=4A020418
- Fibonacci sequence beginning 8, 17.at n=13A022390
- Describe the previous term! (method B - initial term is 5).at n=3A022501
- Prime numbers that are the sum of the divisors of some n.at n=10A023195
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=38A024835
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 34 ones.at n=26A031802
- Number of dyslexic planted planar trees with n nodes.at n=10A032128
- Number of days in n years (n=4 is the first leap year).at n=13A033171
- Number of days in n years (n=3 is the first leap year).at n=13A033172
- Lists of 4 primes in arithmetic progression; common difference 6.at n=14A033449