10479
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16000
- Proper Divisor Sum (Aliquot Sum)
- 5521
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5976
- Möbius Function
- -1
- Radical
- 10479
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- no
- Odd
- yes
Appears in sequences
- Apply partial sum operator 4 times to Stern's sequence.at n=11A014175
- Expansion of 1/((1-x)*(1-2*x)*(1-5*x)*(1-7*x)).at n=4A021124
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0, a(1) = 9.at n=16A022314
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 68.at n=27A031566
- a(n) = (2*n-1)*(n^2 -n +6)/6.at n=31A049480
- Number of factorizations with 2 levels of parentheses indexed by prime signatures. A050338(A025487).at n=40A050339
- Numbers k such that k^16 == 1 (mod 17^3).at n=35A056088
- Sum of terms in n-th row of A081491.at n=13A081492
- Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.at n=49A082922
- Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.at n=26A085483
- Coordination sequence for 12-dimensional cyclotomic lattice Z[zeta_21].at n=4A126902
- a(n) is the smallest integer > a(n-1) such that {Pi^a(n)} < {Pi^a(n-1)}, where {x} = x - floor(x), a(1)=1.at n=10A137994
- Numbers k such that the fractional part of Pi^k is less than 1/k.at n=12A153710
- a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10.at n=16A154496
- a(n) = 338*n + 1.at n=30A158000
- a(n) = 62*n^2 + 1.at n=13A158676
- a(n) = (2*n^3 + 5*n^2 + 11*n)/2.at n=20A162263
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k up-down cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .at n=50A186358
- Number of nonnegative integers with property that their base 7/6 expansion (see A024643) has n digits.at n=51A245402
- Numbers equidistant from twin prime pairs that are also equidistant from numbers equidistant from twin prime pairs.at n=17A260517