7480
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
- 32
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 11960
- 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
- 2560
- Möbius Function
- 0
- Radical
- 1870
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 132
- 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
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=77A013583
- Even heptagonal numbers (A000566).at n=27A014640
- Number of products of distinct primes <= p(n) equal to 1 (mod p(n)).at n=19A024405
- n written in fractional base 10/7.at n=40A024662
- a(n) = position of n^3 + 9 in A003072.at n=40A024971
- Expansion of 1/((1-3x)(1-6x)(1-9x)(1-10x)).at n=3A028083
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=30A029456
- A convolution triangle of numbers obtained from A036070.at n=17A030526
- a(n) = (2*n + 1)*(5*n + 1).at n=27A033571
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/10) starts with n.at n=44A034075
- Trajectory of 3 under map n->27n+1 if n odd, n->n/2 if n even.at n=6A037111
- Triangle T(n,k) read by rows, giving the number of n X n binary matrices with no zero rows or columns and with k=0..n^2 ones.at n=27A055599
- Table read by descending antidiagonals where T(n,k) = T(n,k-1) + T(n,k-1)^2/k^2 and T(n,0)=n.at n=41A061314
- Column 3 of A061314.at n=5A061318
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=3A072494
- Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.at n=5A080395
- a(n) = (3*n+1)*(3*n+4).at n=28A085001
- Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=12A089548
- a(n) = n*(n-1)*(n-2)*(3*n-2)/6.at n=12A096200
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=22A097387