1958
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3240
- Proper Divisor Sum (Aliquot Sum)
- 1282
- 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
- 880
- Möbius Function
- -1
- Radical
- 1958
- 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
- 50
- 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
- a(n) is the number of partitions of n (the partition numbers).at n=25A000041
- Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.at n=19A006416
- a(n) = n*(4*n+1).at n=22A007742
- Coordination sequence T6 for Zeolite Code MTT.at n=27A008194
- Coordination sequence for MgNi2, Position Mg1.at n=11A009936
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=39A011910
- Fibonacci sequence beginning 0, 22.at n=11A022356
- Numbers k such that Fib(k) == -89 (mod k).at n=5A023171
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=21A023865
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=16A024588
- a(n) = position of 5 + n^2 in A004432.at n=47A024808
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=20A024862
- a(n) = T(2n,n+4), T given by A026725.at n=4A026844
- Position of rightmost 0 in 2^n increases.at n=13A031140
- Position of rightmost 0 (including leading 0) in 2^n increases.at n=24A031142
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 4.at n=30A031428
- Number of partitions of n into even parts.at n=50A035363
- Number of partitions of n into parts 6k or 6k+3.at n=75A035377
- Expansion of g.f. x*(1 + 3*x)/((1 + x)*(1 - x)^3).at n=44A035608
- Number of partitions in parts not of the form 17k, 17k+1 or 17k-1. Also number of partitions with no part of size 1 and differences between parts at distance 7 are greater than 1.at n=33A035962