7055
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9072
- Proper Divisor Sum (Aliquot Sum)
- 2017
- 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
- 5248
- Möbius Function
- -1
- Radical
- 7055
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 57
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 4*n^2 - 1.at n=42A000466
- Lucas-Carmichael numbers: squarefree composite numbers k such that p | k => p+1 | k+1.at n=6A006972
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CON = CIT-1 H2[B2Si54O112] starting with a T6 atom.at n=12A019096
- Pseudoprimes to base 84.at n=20A020212
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 17 (most significant digit on left).at n=9A029462
- T(n,1..i) are attractors in '3x+(2n+1)' problem.at n=54A039512
- Conjecturally, largest attractor in '3x+(2n+1)' problem.at n=14A039515
- If p | n, then p+1 | n+1 for composite n.at n=36A056729
- Numbers k such that A055079(k) = 2^k.at n=21A057838
- Squarefree numbers k with largest prime factor = floor(sqrt(k)).at n=13A071311
- Numbers k such that the largest prime power factor of k equals floor(sqrt(k)).at n=36A081807
- Triangle T(n,k) read by rows; given by [0,1,0,1,0,1,0,1,...] DELTA [1,0,1,1,1,2,1,3,1,4,1,5,...], where DELTA is the operator defined in A084938.at n=51A085791
- Numbers k that divide Lucas(k) + 1.at n=23A094398
- Odd numbers k that divide Lucas(k) + 1.at n=6A094399
- Pell pseudoprimes: odd composite numbers n such that P(n)-Kronecker(2,n) is divisible by n.at n=14A099011
- Positive numbers of the form 4*n^2 - 1 which are not semiprimes.at n=33A123754
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=23A134602
- a(n) = 9*n^2-1.at n=27A136016
- a(n) = 36n^2 - 1.at n=13A136017
- a(n) = the smallest positive integer m such that d(m) + d(m+1) = n, where d(m) is the number of positive divisors of m. (a(n) is the smallest m where A092405(m) = n.)at n=50A137179