8474
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 4966
- 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
- 3996
- Möbius Function
- -1
- Radical
- 8474
- 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
- 34
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=37A000125
- a(n) is least k such that k and 2k are anagrams in base n (written in base 10).at n=36A023094
- Numbers having three 5's in base 9.at n=34A043475
- 14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).at n=38A051866
- Number of ordered partitions of partitions.at n=10A055887
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4 + (n + 3)^5.at n=3A061224
- The least k such that A063994(k) = Product_{primes p dividing k} gcd(p-1, k-1) = n, or 0 if there's no such k.at n=36A064234
- Numbers k such that phi(k) + phi(k+1) = k+2.at n=18A067797
- Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.at n=45A082015
- Numbers k such that 10^k + 13 is prime.at n=14A095688
- a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=18A100504
- Number of compositions of n such that the least part occurs with odd multiplicity.at n=14A105200
- Number of tieless (American) football games with n scoring events.at n=4A137684
- Number of reduced words of length n in the infinite affine Weyl group (E_6)^{~} on 7 generators.at n=11A161410
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=36A187062
- Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=13A241284
- Binomial(2n, n) - 2 mod n^4.at n=11A246134
- Numbers n such that the smallest prime divisor of n^2+1 is 101.at n=30A248553
- Smallest even pseudoprime (>2n+1) in base 2n+1.at n=57A253233
- Positive integers m such that pi(k^3) + pi(m^3) is a cube for some k = 1,...,m, where pi(x) denotes the number of primes not exceeding x.at n=18A262698