7450
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13950
- Proper Divisor Sum (Aliquot Sum)
- 6500
- 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
- 2960
- Möbius Function
- 0
- Radical
- 1490
- Omega Function (Ω)
- 4
- 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
- 39
- 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
- Coordination sequence for CaF2(1), F position.at n=29A009924
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=50A025196
- Number of rooted compound windmills (mobiles) of n nodes.at n=11A032200
- Numbers which have more different digits than their squares.at n=39A061277
- a(n) = 6*binomial(n,4) + 3*binomial(n,3) + 4*binomial(n,2) - n + 2.at n=13A066375
- Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).at n=27A066456
- Largest number k such that the interval [k^2,(k+1)^2] contains not more than n pairs of twin primes.at n=41A099154
- a(n) = 2*n*(6*n-1).at n=25A126964
- a(n) = n-th prime * n-th nonprime.at n=34A127118
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 7.at n=32A136899
- Sum of proper divisors minus the number of proper divisors of the number of partitions of n, A000041(n).at n=34A152987
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating all rods.at n=31A160455
- Partial sums of A006156.at n=19A177736
- Table T(n,k) counts the involutions of n with longest increasing contiguous subsequence of length k.at n=56A178249
- Sum of the numbers already killed in the first jump of a Sieve of Eratosthenes table.at n=21A179628
- a(n) = 5*n^2 - 4*n + 1.at n=39A190816
- Number of tatami tilings of an 8 X n grid (with monomers allowed).at n=10A192094
- Number of -5..5 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=1A200201
- T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=16A200204
- Number of -n..n arrays x(0..4) of 5 elements with zero sum and nonzero second and third differences.at n=4A200206