17262
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43056
- Proper Divisor Sum (Aliquot Sum)
- 25794
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 5754
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 128
- 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
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=37A049355
- Engel expansion of 1/gamma, (gamma is the Euler-Mascheroni constant A001620) = 1.73245.at n=12A059191
- Least k such that k*Mersenne - prime(n) + 1 is prime.at n=26A098556
- Numbers n such that 8*10^n + 4*R_n - 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=15A103079
- a(n) = F(n) * Sum_{k|n} 1/F(k), where F(k) is the k-th Fibonacci number.at n=19A111075
- a(n) = F(n) * Sum_{k|n} 1/F(k), where F(k) is the k-th Fibonacci number.at n=20A111075
- a(n) = 7 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=27A120153
- Triangle T(n,k) read by rows: number of k X k symmetric matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=42A138177
- a(n) = Fibonacci(n) * Sum_{d|n} -(-1)^(n/d) / Fibonacci(d).at n=20A203802
- Number of (n+1) X 2 0..3 arrays containing all values 0..3 with every 2 X 2 subblock having one or two distinct values, and new values 0..3 introduced in row major order.at n=5A209962
- Number of (n+1)X7 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or two distinct values, and new values 0..3 introduced in row major order.at n=0A209967
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or two distinct values, and new values 0..3 introduced in row major order.at n=15A209969
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or two distinct values, and new values 0..3 introduced in row major order.at n=20A209969
- a(n) = n*prime(prime(n)) - prime(n).at n=28A230285
- Number of n X 2 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=42A239594
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 318", based on the 5-celled von Neumann neighborhood.at n=29A287628
- Numbers k such that (782*10^k - 71)/9 is prime.at n=21A288483
- Number of multisets of nonempty words with a total of n letters over quinary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A293735
- Rounded value of z(n)*prime(n), where z(n) = imaginary part of n-th nontrivial zero of the Zeta function and prime(n) = n-th prime.at n=35A342756
- Number of integer partitions of n of whose permutations do not all have distinct runs.at n=36A351203