5900
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 7120
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2320
- Möbius Function
- 0
- Radical
- 590
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 142
- 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
- No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.at n=15A000769
- a(n) = floor(n*phi^14), where phi is the golden ratio, A001622.at n=7A004929
- a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=27A014813
- Denominators of continued fraction convergents to sqrt(907).at n=8A042753
- Pisot sequence L(7,8).at n=20A048588
- Pisot sequence L(8,10).at n=19A048591
- Triangle T(n,k) (n>=0, 0 <= k <= n) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R=(1,0), V=(0,1) and D=(1,2).at n=51A071943
- a(n) = n*(n+1)*(n^2 + 21*n + 50)/24.at n=14A101854
- Triangle in A071943 with rows reversed.at n=48A108073
- a(n) is the number of complete squares that fit inside the circle with radius n, drawn on squared paper at (0, 0).at n=44A119677
- Trajectory of 13 under map n -> A132948(n).at n=21A132946
- Numbers n such that n is divisible by (3*s(n)*s(n)+2), where s(n) = sum of digits of n.at n=25A134556
- 10 times pentagonal numbers: a(n) = 5*n*(3*n-1).at n=20A153780
- Partial sums of A160410.at n=17A160799
- Numbers k with the property that the average digit of k^2 is 2.at n=40A164770
- Partial sums of floor(3^n/5).at n=8A178706
- The largest integer that cannot be written as the sum of squares of integers larger than n.at n=29A193018
- The number of subsets of the numbers {1,2,3...,n} consisting of at most 3 elements and at most two of those are even.at n=34A204555
- Smallest m such that A090895(m) = n.at n=57A208852
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n-1.at n=17A211141