9259
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
- 4
- Divisor Sum
- 9504
- Proper Divisor Sum (Aliquot Sum)
- 245
- 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
- 9016
- Möbius Function
- 1
- Radical
- 9259
- 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
- 47
- 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) = T(2n-1,n), where T is the array in A026098.at n=44A026102
- n plus a googol is prime.at n=26A049014
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=13A049968
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=35A054222
- Number of positive integers <= 10^n that are divisible by no prime exceeding 5.at n=17A106598
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=39A109182
- Values of z in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z arranged in order of increasing x.at n=18A138669
- Numbers n with following property: let c = nearest cube to n that is different from n and let p = nearest prime to n that is different from n. Then |n-c| = |n-p|.at n=19A163497
- a(n) = Sum_{k=0..n} binomial(n,k)*3^k*(k+1)^(n-k).at n=5A196795
- Number of n X n X n 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,6,2,4,2,2,1 for x=0,1,2,3,4,5,6.at n=6A197706
- Number of self-inverse permutations p on [n] with displacement of elements restricted by 5: |p(i)-i| <= 5.at n=11A239077
- Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p).at n=47A239958
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=3, a(1)=4, a(2)=5.at n=14A280308
- Numbers k such that 7*10^k - 69 is prime.at n=21A281643
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 525", based on the 5-celled von Neumann neighborhood.at n=13A282909
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=16A300501
- Expansion of Product_{k>=1} (1 + x^k)^(sigma_1(k)-k), where sigma_1(k) = sum of divisors of k (A000203).at n=26A319107
- Expansion of Product_{k>=1} 1/(1 - x^k/(1 - x)^k)^k.at n=9A320563
- Number of arrangements of rooks with rotational symmetry on a triangular grid with n grid points on each side and no two rooks on the same row, column or diagonal.at n=20A326611
- Numbers k such that the k-th and (k+1)-st primes have the same digits.at n=37A342874