16303
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19872
- Proper Divisor Sum (Aliquot Sum)
- 3569
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13056
- Möbius Function
- -1
- Radical
- 16303
- 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
- 159
- 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
- Number of partitions of n, with three kinds of 1,2 and 3 and two kinds of 4,5,6,....at n=14A000715
- Expansion of 1/((1-x)^3 (1-x^2)^2 (1-x^3) (1-x^4)).at n=22A002626
- Number of close-packings with layer-number 3n and space group R3m.at n=14A011956
- Numbers whose base-5 representation has exactly 7 runs.at n=18A043607
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 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=17A049891
- Centered 22-gonal numbers.at n=38A069173
- Numbers n such that n-th and (n+1)-th primes are in A125146.at n=8A128120
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+137)^2 = y^2.at n=9A129544
- Main diagonal of A139755, the table of q-derangement numbers of type A.at n=9A141753
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=9A148487
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, -1, 0), (0, 0, -1), (1, 1, 1)}.at n=8A149657
- Triangle, read by rows, T(n, k) = 1 - floor(n*(n-1)/4) + floor(binomial(n-1,k-1) * binomial(n, k-1)/(2*k)).at n=48A176125
- Triangle, read by rows, T(n, k) = 1 - floor(n*(n-1)/4) + floor(binomial(n-1,k-1) * binomial(n, k-1)/(2*k)).at n=51A176125
- Monotonic ordering of nonnegative differences 2^i-9^j, for 40>=i>=0, j>=0.at n=38A192122
- Monotonic ordering of nonnegative differences 4^i-3^j, for 40>=i>=0, j>=0.at n=35A192148
- Monotonic ordering of nonnegative differences 4^i-9^j, for 40>= i>=0, j>=0.at n=20A192169
- Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 7).at n=30A212366
- Number of n-length words w over binary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=16A213290
- a(n) = 2^n - 81.at n=14A220088
- a(n) = (n/2) * (n^3 - 2*n^2 - 2*n + 5).at n=14A242983