5073
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 2127
- 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
- 3168
- Möbius Function
- -1
- Radical
- 5073
- 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
- 33
- 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
- Number of minimal 3-polyhedra with n edges.at n=16A006868
- Pseudoprimes to base 77.at n=24A020205
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=23A024590
- a(1) = 7; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=27A025006
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=22A025104
- Numbers k such that 31*2^k-1 is prime.at n=21A050541
- a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).at n=25A056789
- Numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers.at n=20A057372
- Numbers k such that k and its reversal are both multiples of 19.at n=16A062907
- Non-palindromic number and its reversal are both multiples of 19.at n=8A062916
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=15A070735
- a(0) = 1, a(1) = 1, a(n) = 2*a(n-1) + (2*n-1)^2*a(n-2) for n > 1.at n=5A072372
- Number of configurations of the 5 X 2 variant of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=48A090036
- Expansion of g.f. (1-x+x^2)/(1+x-x^3).at n=56A104771
- Expansion of -1/(1 - x + x^2 - x^3 + x^4 + x^6).at n=54A125629
- Cumulative sums of A031443.at n=39A145060
- Numbers with distinct digits appearing in partition of decimal expansion of square root of 2. (A002193).at n=34A167834
- Numbers k such that (k^3 + 2, n^3 + 4) is a twin prime pair.at n=30A178337
- Lower Beatty array of the golden ratio, (1+sqrt(5))/2.at n=29A181886
- Number of (n+1) X 7 binary arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=8A186459