5116
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 8960
- Proper Divisor Sum (Aliquot Sum)
- 3844
- 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
- 2556
- Möbius Function
- 0
- Radical
- 2558
- Omega Function (Ω)
- 3
- 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
- 134
- 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
- a(n) = 3*a(n-1) + a(n-2), with a(1)=1 and a(2)=4.at n=7A003688
- Coordination sequence T5 for Zeolite Code HEU.at n=47A008120
- Coordination sequence T7 for Zeolite Code MTW.at n=47A008202
- a(n) = Sum{k=0..n} T(n,k), T given by A026747.at n=11A026754
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 42 ones.at n=16A031810
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=34A036463
- Numbers whose base-4 representation contains exactly two 0's and four 3's.at n=14A045075
- a(n) = T(4,n), array T given by A048483.at n=10A048487
- Numbers n such that 275*2^n-1 is prime.at n=19A050896
- Triangle T(n,k) (0<= k <=n) read by rows. Left edge is 1, 0, 0, ... Otherwise each entry is sum of entry to left, entries immediately above it to left and right and entry directly above it 2 rows back.at n=41A059283
- a(n) = (11*n^2 - 11*n + 2)/2.at n=30A069125
- Interprimes which are of the form s*prime, s=4.at n=21A075279
- Diagonal of triangular spiral in A051682.at n=33A081268
- Smallest k such that k^2-1 is a squarefree number with n prime divisors. a(n) = A088027(n)^(1/2).at n=6A088028
- Number of 5k+1 primes (A030430) in range [2^n,2^(n+1)].at n=17A095021
- Structured octagonal anti-prism numbers.at n=11A100184
- Fixed-j dispersion for Q = 13: array D(g,h) (g, h >= 1), read by ascending antidiagonals.at n=24A120862
- Triangular array read by rows: see Comments for definition.at n=30A121875
- Start with 1, then alternately add 2 or double.at n=20A123208
- a(n) = 5*n^2 + 10*n + 1. Coefficients of the rational part of (1 + sqrt(n))^5.at n=31A134593