7323
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9768
- Proper Divisor Sum (Aliquot Sum)
- 2445
- 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
- 4880
- Möbius Function
- 1
- Radical
- 7323
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 163
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 85.at n=7A031583
- Numbers whose set of base-13 digits is {3,4}.at n=21A032837
- Number of primes between n*100000 and (n+1)*100000.at n=8A038825
- a(n)=T(2n-1,n), array T given by A048212.at n=44A048221
- Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) - 9 for n > 0.at n=17A101128
- a(1) = 10; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A111524
- Numbers m such that (15m-4, 15m-2, 15m+2, 15m+4) is a prime quadruple.at n=38A112540
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=44A114486
- Number of quadruples [i,j,k,l] with all entries between 1 and n such that gcd(i,j) = gcd(k,l).at n=10A124162
- a(n) = 8*a(n-1) - 5*a(n-2).at n=5A138513
- 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, 0, 0), (-1, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=8A149321
- 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, 0, 0), (-1, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A149797
- a(n) is the smallest number which has in its English name the letter "e" in the n-th position beginning the count from the end, or -1 if no such number exists.at n=34A173203
- Some numbers of the form 2*x^3 + y^3 + z^3 found by a certain algorithm.at n=17A195006
- Number of (n+1) X 4 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=16A206262
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=2|x-y|+2|y-z|.at n=31A212576
- a(n) = round( (e/2)^n ).at n=32A230580
- Sum of the three largest parts in the partitions of 4n into 4 parts.at n=7A243011
- Numbers such that the sum of their digits is equal to the sum of digits of their aliquot parts.at n=39A274218
- a(n) = A277715(n) / 3.at n=42A277716