7388
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12936
- Proper Divisor Sum (Aliquot Sum)
- 5548
- 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
- 3692
- Möbius Function
- 0
- Radical
- 3694
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 70
- 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
- Number of partitions into non-integral powers.at n=35A000148
- a(n) = prime(n)*prime(n-1) + 1.at n=23A023523
- Numbers whose maximal base-9 run length is 4.at n=16A037999
- Numbers having four 1's in base 9.at n=11A043460
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n 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=43A050065
- Number of directed multigraphs with loops on 4 nodes with n arcs.at n=7A050929
- Numbers k such that k^512 + 1 is prime.at n=22A057465
- a(n) = Sum_{k=1..n} C(3*k,k)/3.at n=5A087413
- a(0)=1. a(n) = a(n-1)*2, if n is in the sequence. a(n) = a(n-1) + 1 if n is missing from the sequence.at n=49A118551
- Numbers n for which 12n+1, 12n+5, 12n+7 and 12n+11 are primes.at n=34A123985
- a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.at n=47A126428
- Expansion of g.f. (3 -x +2*x^2)/(1 -3*x +2*x^2 -x^3).at n=9A136305
- Infinite square array: T(n,k) = number of directed multigraphs with loops with n arcs and k vertices; read by falling antidiagonals.at n=73A138107
- 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, -1), (-1, -1, 1), (0, 1, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150464
- Number of compositions of n where each pair of adjacent parts is relatively prime.at n=15A167606
- Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=18A178360
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 10 integral solutions.at n=38A179153
- Number of nondecreasing strings of numbers x(i=1..8) in -n..n with sum x(i)^3 equal to 0.at n=13A188282
- G.f. satisfies: 1 = Sum_{n>=0} (-x)^(n^2) * A(x)^(2*n+1).at n=7A193115
- Number of nX2 0..2 arrays with every diagonal, row and column running average nondecreasing rightwards and downwards and diagonally.at n=8A201149