6309
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9126
- Proper Divisor Sum (Aliquot Sum)
- 2817
- 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
- 4200
- Möbius Function
- 0
- Radical
- 2103
- Omega Function (Ω)
- 3
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 93
- 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
- no
- Odd
- yes
Appears in sequences
- Powers of fifth root of 10 rounded down.at n=19A018141
- Expansion of Product_{m>=1} (1+x^m)^18.at n=4A022583
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=32A029488
- Numbers k such that 261*2^k+1 is prime.at n=45A032507
- Multiplicity of highest weight (or singular) vectors associated with character chi_186 of Monster module.at n=38A034574
- a(1)=1, a(n) = smallest odd number such that all sums of pairs of (not necessarily distinct) terms in the sequence are distinct.at n=41A034757
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 6.at n=32A038637
- 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) = a(2) = 1 and a(3) = 2.at n=40A050028
- 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) = 2.at n=40A050044
- 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, a(2) = 3, and a(3) = 2.at n=40A050060
- Number of 4 X n binary matrices with 1 unit column up to row and column permutations.at n=7A057222
- a(n) = floor( n^e ), e = 2.718281828...at n=24A061293
- Sum of the first n Sophie Germain primes.at n=27A066819
- Total number of parts in all partitions of n into odd parts.at n=35A067588
- Number of wide partitions of n.at n=43A070830
- a(1) = 7; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A074343
- Number of A095747-primes in range ]2^n,2^(n+1)].at n=32A095757
- Number of A095747-primes in range ]2^(2n-1),2^2n].at n=16A095760
- Iccanobirt prime indices (7 of 15): Indices of prime numbers in A102117.at n=11A102137
- Largest number whose 5th power has n digits.at n=18A114323