5090
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9180
- Proper Divisor Sum (Aliquot Sum)
- 4090
- 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
- 2032
- Möbius Function
- -1
- Radical
- 5090
- 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
- 41
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T2 for Zeolite Code MTW.at n=47A008197
- Numbers k such that the continued fraction for sqrt(k) has period 9.at n=28A010339
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=32A015709
- Composite and even n such that phi(n) * sigma(n) is one less than a square.at n=19A015721
- Numbers k such that 223*2^k+1 is prime.at n=23A032488
- Expansion of Product_{d | 48} theta_3(q^d).at n=48A033760
- Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).at n=5A033861
- Differences of A038011.at n=1A038012
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=12A045198
- Sum_{i for which n - i*(i-1)/2 >= 0} binomial (n - i*(i-1)/2, i).at n=23A063978
- Least m such that A(m) = -10^n, where A(n) = sigma(n) - 2n, the abundance of n.at n=3A075767
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=12A084048
- Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.at n=31A085690
- Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.at n=23A086640
- G.f.: (1+x^8+x^9+x^10+x^18)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)).at n=52A097851
- Triangle read by rows: even-numbered rows of A106580.at n=59A106585
- Least positive k such that k * [RSA-640]^n - 1 is prime, where RSA-640 is the 193 decimal digit RSA challenge number A391940(14).at n=20A108573
- Numbers k such that 10*(11*10^k-1) + 3 is prime or PRP.at n=19A123383
- a(n) = prime(n)^2 - prime(n^2). Commutator of (primes, squares) at n.at n=26A123914
- a(1) = 1; for n>1, a(n) = smallest number which is not a sum or product or power of any subset of the numbers a(1) to a(n-1).at n=14A126326