6503
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7440
- Proper Divisor Sum (Aliquot Sum)
- 937
- 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
- 5568
- Möbius Function
- 1
- Radical
- 6503
- 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
- 62
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RTH = RUB-13 [B2Si30O64].2R starting with a T2 atom.at n=12A019227
- Numbers k such that Fib(k) == 13 (mod k).at n=33A023178
- 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 79.at n=28A031577
- Numerators of continued fraction convergents to sqrt(56).at n=4A041096
- Number of partitions of n with nonnegative rank.at n=33A064174
- Number of (3412,1234)-avoiding involutions in S_n.at n=23A085583
- Molien series for complete weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.at n=8A092548
- a(n) = floor(a(n-2)^2/a(n-1)) + a(n-1) + a(n-2), a(0) = 0, a(1) = 1, a(2) = 1, ...at n=16A096081
- a(n) = T(p(n)) - p(T(n)) = Commutator[triangular numbers, primes] at n.at n=35A123907
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=25A127485
- a(n) = 4*n^3 - 3*n^2 + 2*n - 1.at n=11A131464
- Transposition classes of Latin trades of size n.at n=13A133169
- Transposition classes of ordered Latin bi-trades of size n.at n=13A133175
- Numbers n such that primorial(n)/2 + 256 is prime.at n=19A139451
- a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any six consecutive digits in the sequence sum up to a prime.at n=22A152606
- Number of nondecreasing arrangements of n+3 numbers in 0..8 with each number being the sum mod 9 of three others.at n=4A183903
- a(n)=(a(n-1)^2*a(n-2)+1)/a(n-3) with a(0)=a(1)=a(2)=1.at n=6A208206
- Number of partitions p of n such that the multiplicity of the mean of p is a part of p.at n=50A240491
- Partial sums of A301688.at n=55A301689
- Number of minimal dominating sets in the n-dipyramidal graph (for n > 3).at n=25A347638