6369
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9312
- Proper Divisor Sum (Aliquot Sum)
- 2943
- 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
- 3840
- Möbius Function
- -1
- Radical
- 6369
- 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
- 106
- 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) = ceiling(n*phi^11), where phi is the golden ratio, A001622.at n=32A004966
- Pseudoprimes to base 23.at n=41A020151
- Pseudoprimes to base 67.at n=44A020195
- a(n) = T(2n,n), where T is the array defined in A025564.at n=6A025570
- a(n) = T(n,[ n/2 ]), where T is the array defined in A025564.at n=12A025575
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 52.at n=32A031550
- Lucky numbers that are decimal concatenations of n with n + 6.at n=9A032656
- a(n) = (2*n+1)*(12*n+1).at n=16A033576
- Trajectory of 1 under map n->25n+1 if n odd, n->n/2 if n even.at n=10A033969
- Number of partitions in parts not of the form 23k, 23k+3 or 23k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=34A035991
- Pure 2-complexes on an infinite set of nodes with n multiple 2-simplexes. Also n-rowed binary matrices with all row sums 3, up to row and column permutation.at n=6A050913
- 14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).at n=33A051866
- Nearest integer to log(n!)^(1 + log(1 + log(1 + n))).at n=19A062446
- Numbers k such that [A070080(k), A070081(k), A070082(k)] is an obtuse integer triangle with integer area.at n=30A070147
- a(1) = 9; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A074345
- Numbers k such that the concatenation of k with k-8 gives a square.at n=2A115435
- Numbers k such that k concatenated with k-9 gives the product of two numbers which differ by 2.at n=2A116095
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=14A138853
- Numbers which are the sum of three cubes of distinct primes.at n=28A138854
- a(n) = 3^n - 3*2^(n-2).at n=6A169687