10976
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 14224
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4704
- Möbius Function
- 0
- Radical
- 14
- Omega Function (Ω)
- 8
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers of form 2^i*7^j, with i, j >= 0.at n=41A003591
- Expansion of tanh(sinh(log(1+x))).at n=8A009802
- Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=33A019575
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=26A024850
- Number of labeled servers of dimension 16.at n=3A027403
- Expansion of (theta_3(z)*theta_3(23z)+theta_2(z)*theta_2(23z))^4.at n=28A028660
- Denominator of n * Product_{d|n} (1 + 1/d).at n=55A029934
- A convolution triangle of numbers obtained from A001792.at n=38A030523
- a(n) = 4*n^3.at n=14A033430
- Otto Haxel's guess for magic numbers of nuclear shells.at n=32A033547
- Numbers whose prime factors are 2 and 7.at n=23A033847
- a(n) = ceiling((n^3)/2).at n=28A036486
- a(n) = floor((n^3)/2).at n=28A036487
- Triangle of numbers in which i-th row is {2^(i-j)*7^j, 0<=j<=i}; i >= 0.at n=39A036565
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*8^j.at n=11A038274
- Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*7^j.at n=13A038285
- Numbers k that divide sigma(k) * phi(k) and are not divisible by 6.at n=41A047630
- Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.at n=27A050442
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.at n=24A071210
- Largest proper divisor of n^3.at n=26A071378