7473
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 2895
- 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
- 4784
- Möbius Function
- -1
- Radical
- 7473
- 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
- 101
- 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
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=a(2)=1.at n=16A000213
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=32A001976
- Numbers whose set of base-15 digits is {2,3}.at n=21A032815
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples.at n=27A034803
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples.at n=25A034804
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 3).at n=39A035539
- A035539 with periodic zeros stripped.at n=12A035593
- Denominators of continued fraction convergents to sqrt(927).at n=7A042793
- Numbers whose base-3 representation has exactly 9 runs.at n=22A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=38A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=22A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=22A043824
- a(n)=T(n,n+1), array T as in A049735.at n=34A049741
- a(n)=A074639(A074647(n)).at n=31A074648
- Expansion of 1/( (1-x)*(1 + x^2 + x^3) ).at n=50A077889
- Expansion of (1-x)/(1 + x + x^2 - x^3).at n=32A078046
- a(n) = round(n^3/12) - floor(n/4)*floor((n+2)/4).at n=45A090676
- a(n) = 3a(n-1)+a(n-2)+a(n-3), a(0)=1, a(1)=1, a(2)=5.at n=8A098184
- Numerator of the best rational approximation to Pi^2+e^2 in orders of magnitude 10^n.at n=3A108147
- Numerator of the best rational approximation to Pi^2+e^2 in orders of magnitude 10^n.at n=2A108147