7750
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 7226
- 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
- 3000
- Möbius Function
- 0
- Radical
- 310
- 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
- yes
- 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
- 52
- 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
- Number of reversible strings with n beads of 5 colors. If more than 1 bead, not palindromic.at n=5A032088
- a(n) = 2*n*(4*n + 1).at n=31A033585
- Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=9A045187
- Number of dissectable polyhedra with n tetrahedral cells and symmetry of type D.at n=40A047773
- Inverse Moebius transform of A001037 (starting at term 0).at n=17A054080
- Numbers n such that n | 5^n + 4^n + 3^n.at n=22A057236
- Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.at n=41A060544
- Triangular numbers of the form 10*k.at n=25A069498
- Smallest integer >= 0 of the form x^4 - n^3.at n=34A070928
- Rearrangement of triangular numbers such that sum of two consecutive terms is a prime.at n=49A073655
- Triangular numbers which are 5-almost primes.at n=24A076579
- Positive integers not expressible as the sum of a prime and a triangular number.at n=50A076768
- Smaller of the two successive triangular numbers which differ in the use of only one digit.at n=28A077759
- Third row of Pascal-(1,6,1) array A081581.at n=18A081591
- Hypotenuses for which there exist exactly 3 distinct integer triangles.at n=40A084647
- a(n) = A000217(n^3) - n^3.at n=5A085744
- a(n) = A063997(n)/4.at n=24A088406
- Numbers which are the sum of three positive cubes and divisible by 31.at n=35A104054
- Array read by antidiagonals: T(n,m) = Sum m^max(k,n-k),k=0..n.at n=50A107661
- a(n) = a(n-1) + a(n-2) + 2 where a(0) = a(1) = 1.at n=17A111314