7482
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 8358
- 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
- 2352
- Möbius Function
- 1
- Radical
- 7482
- Omega Function (Ω)
- 4
- 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
- yes
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
- yes
- 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 series-parallel networks with n edges.at n=11A001677
- a(n) = 2*n*(2*n+1).at n=43A002943
- Number of partitions of n into partition numbers.at n=53A007279
- n written in fractional base 10/7.at n=42A024662
- a(n) = (-1 + prime(n+1)^2)/4.at n=38A024701
- Numbers k such that 189*2^k+1 is prime.at n=22A032471
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=25A034076
- a(n) = least integer m such that the part after the decimal point of the n-th root of m starts with the digit 5.at n=20A034082
- Numbers whose base-3 representation has exactly 9 runs.at n=24A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=40A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=24A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=24A043824
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.at n=28A051941
- Numbers k such that k^18 == 1 (mod 19^3).at n=20A056089
- a(1) = 1; a(n) = gcd {n*(n+1), a(n-1) * (a(n-1) + 1)} for n > 1.at n=85A062321
- Engel expansion of sinh(1).at n=43A068377
- a(1) = 1, a(n+1) is the smallest number such that there are n primes between a(n) and a(n+1) exclusive.at n=43A075342
- 4-almost primes equal to the product of two successive semiprimes.at n=28A108215
- Numbers n such that A001414(n) is a golden semiprime, where A001414 is the sum of primes dividing n (with repetition).at n=45A108219
- 6 times pentagonal numbers: a(n) = 3*n*(3*n-1).at n=29A152743