7030
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 6650
- 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
- 2592
- Möbius Function
- 1
- Radical
- 7030
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 150
- 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
- Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=18A002414
- a(n) = Sum_{k=1..n} (n-k) * floor(n/k).at n=46A024920
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=15A049927
- Numbers n such that 257*2^n-1 is prime.at n=24A050887
- Even-indexed Chebyshev U-polynomials evaluated at sqrt(11)/2.at n=4A057081
- Squarefree numbers having exactly three prime gaps.at n=37A073489
- Sum of terms in n-th group in A075352.at n=38A075356
- a(n) = (n+1)*(2*n+1)*(4*n+1).at n=9A079588
- Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n.at n=6A090057
- Structured icosidodecahedral numbers.at n=9A100147
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = 8*k^2 + 4*k + 1.at n=30A103777
- a(n) = binomial(n,3) - binomial(floor(n/2),3) - binomial(ceiling(n/2),3).at n=39A111384
- a(n) = n*(n+7)*(n+8)/6.at n=30A111396
- 10 times triangular numbers: a(n) = 5*n*(n + 1).at n=37A124080
- a(1)=1, a(n) = a(n-1) + (p-1)*p^(n/2-1) if n is even, otherwise a(n) = a(n-1) + p^((n-1)/2), where p=5.at n=10A133629
- Numbers n such that A133744(n) = 0.at n=22A133745
- Ten times hexagonal numbers: 10*n*(2*n-1).at n=19A144560
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, 1), (0, 1, 1), (1, 0, -1)}.at n=9A148445
- a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any five consecutive digits in the sequence sum up to a prime.at n=25A152605
- Row sums of triangle T(j,k) = (j^k) mod (j*k) for 1 <= k <= j (see A096133).at n=36A157351