8958
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17928
- Proper Divisor Sum (Aliquot Sum)
- 8970
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2984
- Möbius Function
- -1
- Radical
- 8958
- 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
- 140
- 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
- Convolution of A000201 with itself.at n=26A023663
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ (n/k)*[ n/k ] ] ].at n=17A024933
- The 5x + 1 sequence beginning at 7.at n=23A028389
- Number of mobiles (circular rooted trees) with n nodes and 3 leaves.at n=23A055341
- Numbers which are the sum of their proper divisors containing the digit 9.at n=26A059468
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=19A063058
- Numbers such that the nonzero product of the digits of its 4th power is also a 4th power.at n=7A066734
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=40A073535
- Larger terms of the pairs (a < b) in the sequence {a,b}-> {Max[{a,b}]-Min[{a,b}],k*Min[{a,b}]} with k=3 and the first pair {a=1,b=2}. See A075256.at n=38A075258
- The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=34A102186
- a(n) = (1/3)*n^3 - n^2 - (1/3)*n - 1.at n=31A109620
- a(n) = 289*n - 1.at n=30A158253
- Trajectory of 7 under repeated application of the map in A185452.at n=13A185455
- Numbers n such that d(n-1) = d(n+1) = 6, where d(k) is the number of divisors of k (A000005).at n=32A190267
- Values of the difference d for 5 primes in arithmetic progression with the minimal start sequence {5 + j*d}, j = 0 to 4.at n=39A206039
- 5x + 1 sequence beginning at 11.at n=27A259193
- Least k such that binomial(k, 2) >= binomial(2*n, n).at n=14A270440
- Even numbers n such that A048633(n+1) = A048633(n).at n=35A331586
- Numbers k such that k + the sum of the 4th powers of the decimal digits of k is a square.at n=41A338235
- Number of ways to write n as an ordered sum of 9 squares of positive integers.at n=48A340946