9592
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 19800
- Proper Divisor Sum (Aliquot Sum)
- 10208
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 2398
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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 corners, or planar partitions of n with only one row and one column.at n=19A006330
- Number of primes < 10^n.at n=5A006880
- Expansion of Product_{m>=1} (1 + m*q^m)^11.at n=5A022639
- a(n) = (1/2)*(3rd elementary symmetric function of C(n,0), C(n,1), ..., C(n,n)).at n=4A025132
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=8A031783
- Number of primes less than 10000n.at n=9A038813
- Number of primes less than 100000n.at n=0A038814
- Number of primes between n*100000 and (n+1)*100000.at n=0A038825
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.at n=33A072205
- Members of A000124 which are multiples of 11.at n=25A083511
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.at n=39A092231
- Expansion of q * (chi(-q) * chi(-q^5))^-4 in powers of q where chi() is a Ramanujan theta function.at n=13A093831
- Number of different initial values for 3x+1 trajectories started with initial values not exceeding 2^n and in which the peak values are larger than 2^n.at n=13A095383
- Number of n-bit base-2 deletable primes.at n=19A096235
- Reduced denominators of the fraction of primes < 10^n that are full reptend primes.at n=4A103363
- Number of primes <= 10^(n/2).at n=10A122121
- Triangle read by rows: T(k,n) is number of numbers <= 10^n that are products of k primes.at n=31A126280
- A007318 * A000203.at n=10A131046
- a(n) = (5*n-7)*(n-1).at n=44A147874
- 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, 0), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=8A149039