8496
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 24180
- Proper Divisor Sum (Aliquot Sum)
- 15684
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2784
- Möbius Function
- 0
- Radical
- 354
- Omega Function (Ω)
- 7
- 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
- 127
- 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
- Number of spanning trees with degrees 1 and 3 in K_4 X P_n.at n=3A003774
- Number of labeled connected graphs with n vertices and 1 cutpoint.at n=3A013923
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=37A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=37A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=37A050064
- Numbers k such that phi(x) = k has exactly 11 solutions.at n=28A060674
- Successive maxima in sequence A060457.at n=42A061011
- Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n^2.at n=9A065089
- Numbers k such that phi(k) divides (sigma(k+2) + sigma(k-2)).at n=43A067245
- Numbers k such that the squarefree part of k equals A062799(k).at n=21A069551
- Coefficient of x^n in g.f.^n is A004123(n).at n=6A088222
- Structured hexagonal anti-prism numbers.at n=15A100183
- Number of Barlow packings that repeat after n (or a divisor of n) layers.at n=20A114438
- Numbers k such that k^3 contains a pandigital substring.at n=7A115933
- Number of permutations of length n which avoid the patterns 231, 12534.at n=9A116845
- Lynch-Bell numbers k such that 1 is not a digit of k.at n=47A116960
- Numbers n such that every digit occurs at least once in n^3.at n=34A119735
- 3*Volume of the root-n Waterman polyhedron of void-center type as defined in A119870.at n=40A119878
- Triangle read by rows, where t(n,1) = 1, t(n,m) = t(n,m-1) + (largest noncomposite {1 or prime} in row {n-1}).at n=41A120852
- Numbers with 30 divisors.at n=37A137493