10458
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 15750
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2952
- Möbius Function
- 0
- Radical
- 3486
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 179
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=38A025197
- Theta series of 6-dimensional perfect lattice P6.6 = A6,1.at n=32A029695
- A convolution triangle of numbers obtained from A034171.at n=16A035529
- Number of nonprimes <= prime(n)^2.at n=28A053683
- Sum of the reverses of the first n primes.at n=41A071602
- 3 times hexagonal numbers: a(n) = 3*n*(2*n-1).at n=42A094159
- Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/3) = 3^n, where R_n(y) forms the initial (n+1) terms of g.f. A057083(y)^(n+1).at n=25A097186
- a(n) = sum of n-th column in array in A100452.at n=22A100454
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=26A124140
- Multiples of 7, k, such that k +/- 1 are twin primes.at n=39A127545
- Row sums of A154685.at n=20A151675
- 9 times pentagonal numbers: 9*n*(3*n-1)/2.at n=28A152996
- Averages of twin prime pairs such that p1 * p2 + AverageTwinPrime is prime.at n=39A154667
- Binomial transform of A052551.at n=10A156664
- Averages of twin prime pairs which can be represented as a sum of three consecutive of such pair averages.at n=14A160917
- a(n) = A030068(4n+1).at n=41A169739
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having four, five, six, seven or eight distinct values for every i,j,k<=n.at n=7A211598
- Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly four solutions.at n=36A230856
- Number of partitions p of n such that (number of distinct parts of p) >= max(p) - min(p).at n=48A239958
- Numbers n such that n is the average of four consecutive primes n-5, n-1, n+1 and n+5.at n=25A258088