8063
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8808
- Proper Divisor Sum (Aliquot Sum)
- 745
- 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
- 7320
- Möbius Function
- 1
- Radical
- 8063
- Omega Function (Ω)
- 2
- 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
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of partitions of n into 10 unordered relatively prime parts.at n=35A023030
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=42A026052
- Sums of 12 distinct powers of 2.at n=5A038463
- Numerators of continued fraction convergents to sqrt(383).at n=5A041726
- Composite numbers k for which phi(k) + sigma(k) is an integer multiple of the 4th power of the number of divisors of k.at n=35A055468
- Nearest integer to log(n^n)^log(n).at n=12A062432
- Semiprimes p1*p2 such that p2>p1 and p2 mod p1 = 7.at n=39A064905
- Least m such that reverse(sigma(m)) = sigma(m+n).at n=23A071813
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=31A075421
- Number of permutations of length n containing 2 occurrences of 132.at n=5A082970
- a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.at n=31A091676
- Numbers that contain a single zero in bases 2 and 10.at n=24A118681
- 2*A007318^(2) - A000012.at n=49A132307
- a(n) = (n! - 5)/5.at n=3A139175
- A sequence of asymptotic density zeta(8) - 1, where zeta is the Riemann zeta function.at n=32A143034
- Numbers of length n binary words with fewer than 7 0-digits between any pair of consecutive 1-digits.at n=13A145115
- a(n) = the smallest positive integer m with exactly n (no more, no fewer) distinct primes represented in binary as substrings within the binary representation of m.at n=22A146526
- Integers with the same number of zeros in base 10 and base 2.at n=43A153114
- Numerator of Euler(n, 6/23).at n=3A156948
- a(n) = 288*n - 1.at n=27A157997