5929
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 9
- Divisor Sum
- 7581
- Proper Divisor Sum (Aliquot Sum)
- 1652
- 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
- 4620
- Möbius Function
- 0
- Radical
- 77
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- 186
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of simple triangulations of the plane with n nodes.at n=9A000256
- Squares of partition numbers.at n=12A001255
- Numbers of the form 7^i*11^j.at n=12A003599
- Squares of palindromes.at n=16A014186
- Odd heptagonal numbers (A000566).at n=24A014637
- Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers.at n=38A016754
- a(n) = (3n+2)^2.at n=26A016790
- a(n) = (4*n + 1)^2.at n=19A016814
- a(n) = (5*n + 2)^2.at n=15A016874
- a(n) = (6*n + 5)^2.at n=12A016970
- a(n) = (7*n)^2.at n=11A016982
- a(n) = (8*n + 5)^2.at n=9A017126
- a(n) = (9*n + 5)^2.at n=8A017222
- a(n) = (10*n + 7)^2.at n=7A017354
- a(n) = (11*n)^2.at n=7A017390
- a(n) = (12*n + 5)^2.at n=6A017582
- Sum of distinct prime divisors of p(n)*p(n-1) + 1.at n=36A023529
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=24A024590
- a(n) = least m such that if r and s in {1/4, 1/8, 1/12,..., 1/4n} satisfy r < s, then r < k/m < s for some integer k.at n=43A024825
- 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=41A024835