5071
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5544
- Proper Divisor Sum (Aliquot Sum)
- 473
- 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
- 4600
- Möbius Function
- 1
- Radical
- 5071
- 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
- 85
- Smith Number
- yes
- 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 Fielder sequence.at n=13A001643
- a(n) = a(n-1) + a(n-2) + a(n-3), a(0)=3, a(1)=1, a(2)=3.at n=14A001644
- Tetranacci numbers A073817 without the leading term 4.at n=12A001648
- 4-dimensional analog of centered polygonal numbers.at n=10A006323
- Positive integers n such that 2^n == 2^11 (mod n).at n=57A015935
- Pseudoprimes to base 93.at n=36A020221
- a(n) = n*(21*n-1)/2.at n=22A022278
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=21A025114
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=38A036000
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=30A036927
- a(n)=(s(n)+5)/10, where s(n)=n-th base 10 palindrome that starts with 5.at n=29A043084
- Numbers whose base-4 representation contains exactly two 0's and four 3's.at n=12A045075
- T(n,n-2), array T as in A047120.at n=7A047124
- Numbers k such that k^16 == 1 (mod 17^3).at n=17A056088
- First (leftmost) digit - second digit + third digit - fourth digit .... = 11.at n=47A061880
- Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.at n=29A064908
- Numbers n such that phi(2n+1) = sigma(n).at n=29A067229
- Numbers k such that sigma(k) = phi(k*bigomega(k)+1).at n=34A067876
- Numbers k such that sigma(k) = phi(k*omega(k)+1).at n=34A067879
- Composite numbers with all divisors congruent to 1 mod 10.at n=37A068872