7133
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8160
- Proper Divisor Sum (Aliquot Sum)
- 1027
- 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
- 6108
- Möbius Function
- 1
- Radical
- 7133
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 49
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = Sum_{k >= 1} floor(2*tau^(n-k)).at n=15A020957
- Convolution of A000201 with itself.at n=24A023663
- Number of partitions of n that do not contain 6 as a part.at n=33A027340
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 18.at n=38A050967
- Numbers m such that the minimal value of abs(2^m - 3^x) > 0 is prime (i.e., m such that A064024(m) is prime).at n=24A073073
- Numbers n such that googol - n is prime.at n=24A108251
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=16A118156
- Start with 34 and repeatedly reverse the digits and add 16 to get the next term.at n=37A119454
- a(n) = 343*n - 70.at n=20A157374
- Numbers n such that the digits of sigma(n) are exactly the same (albeit in different order) as the digits of phi(n), in base 10.at n=15A175795
- If, for some m, A098550(m-2) is a prime p and A098550(m) = 7p, add 7p to the sequence.at n=34A253054
- a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 5's.at n=8A254500
- Expansion of phi(-x^5) * f(x^2, x^8) / psi(-x)^2 in powers of x where phi, psi, f(,) are Ramanujan theta functions.at n=22A259392
- Numbers k dividing every cyclic permutation of k^k.at n=38A262814
- The icosagen sequence : a(n) = A018227(n)-5, for n >= 2.at n=31A271997
- Unary-binary representation of Stern polynomials: a(n) = A156552(A260443(n)).at n=39A277020
- Odd bisection of A277020: a(n) = A277020(2n+1).at n=19A277189
- Partial sums of A019565.at n=36A288570
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + 2*n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=13A294558
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A295367