9273
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13536
- Proper Divisor Sum (Aliquot Sum)
- 4263
- 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
- 5600
- Möbius Function
- -1
- Radical
- 9273
- Omega Function (Ω)
- 3
- 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
- 153
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = floor(Fibonacci(n)/5).at n=24A004698
- a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=11A004949
- a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=11A004969
- a(n) = n*(17*n + 1)/2.at n=33A022275
- Generalized Pellian with second term equal to 9.at n=9A048696
- Numbers k such that the smoothly undulating palindromic number (72*10^k - 27)/99 is a prime.at n=8A062221
- Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once.at n=10A064160
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=37A086769
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [2;2,2,...(n 2's)...,2,n+1], starting with [1], [2;2], [2;2,3], [2;2,2,4], ...at n=8A088210
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=34A096906
- a(n) = floor(L^3*{phi^(3*n-2), phi^(3*n-1), phi^(3*n-2) + phi^(3*n-1)}) where L = (1 + sqrt(5))/(2*sqrt(5)) and phi = (1 + sqrt(5))/2.at n=20A115315
- Sum of all repeated parts of all partitions of n.at n=19A163986
- Row sums of triangle A175009.at n=21A175006
- Expansion of 1/((1 - x^3 - x^4)*(1 + x)).at n=55A175790
- Number of strings of numbers x(i=1..n) in 0..2 with sum i^4*x(i) equal to n^4*2.at n=25A184341
- Inverse permutation to A190128.at n=24A190129
- [s(k)-s(j)]/5, where the pairs (k,j) are given by A205852 and A205853, and s(k) denotes the (k+1)-st Fibonacci number.at n=38A205855
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209820; see the Formula section.at n=53A209819
- Number of (n+1)X2 0..2 matrices with each 2X2 permanent equal.at n=4A225020
- Number of (n+1)X6 0..2 matrices with each 2X2 permanent equal.at n=0A225024