8435
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11616
- Proper Divisor Sum (Aliquot Sum)
- 3181
- 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
- 5760
- Möbius Function
- -1
- Radical
- 8435
- 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
- 57
- 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
- a(n) = (n+2)*(n+1)*(n^2 + 7*n - 12)/24.at n=18A014309
- Positive integers n such that 2^n == 2^11 (mod n).at n=75A015935
- Number of partitions of n into 6 unordered relatively prime parts.at n=49A023026
- Numbers whose base-4 representation contains exactly three 0's and three 3's.at n=32A045079
- Digitally balanced numbers in both bases 2 and 3.at n=8A049361
- Fourth column (r=3) of FS(3) staircase array A062745.at n=34A062748
- Number of primes less than 10^n with initial digit 7.at n=5A073511
- a(n) = M(2^n), where M(n) is Mertens's function, A002321.at n=35A084236
- a(n) = 4*a(n-1) - 4*a(n-2) + 3*a(n-3).at n=9A099215
- a(n) = 6*n*(n-1) - 1.at n=38A103115
- First element of first run of exactly n consecutive numbers not of form x^2+y^2.at n=14A104271
- Numbers k such that k^6+6 is prime.at n=37A109836
- Numerator of sum of reciprocals of first n pentatope numbers A000332.at n=34A118411
- a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 1,3,9,11.at n=9A135365
- Smallest positive integer such that a(1)+...a(n) divides 123...n (=A007908(n)).at n=6A165771
- Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes.at n=21A173092
- a(n) = floor((3^n)/(2*n - 1)).at n=10A191632
- a(1)=1; a(n) = floor((3 + sqrt(21))*a(n-1)/2) for n > 1.at n=7A196472
- Numbers n such that n+(n+1), n^2+(n+1)^2, n+(n+1)^2, n^2+(n+1) are all prime.at n=17A216270
- a(n) = (6*n^2 + 7*n - 9 + 2*n^3)/12 - (-1)^n*(n+1)/4.at n=35A219527