16383
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22528
- Proper Divisor Sum (Aliquot Sum)
- 6145
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10584
- Möbius Function
- -1
- Radical
- 16383
- 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
- a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)at n=14A000225
- Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).at n=12A000236
- Divisors of 2^14 - 1.at n=7A003525
- Divisors of 2^28 - 1.at n=31A003536
- Divisors of 2^42 - 1.at n=33A003547
- a(n+1) = a(n)-th composite number, with a(0) = 1.at n=37A006508
- Stirling numbers of second kind S2(15,n).at n=1A011564
- Nexus numbers (n+1)^14 - n^14.at n=1A022530
- a(n) = 4^n - 1.at n=7A024036
- Special connected numbers: minimal and maximal connected numbers (cf. A029827) of a given binary order, i.e., between two consecutive powers of 2.at n=19A036379
- Numbers whose base-3 and base-4 expansions have no digits in common.at n=14A037345
- Numbers having four 7's in base 8.at n=3A043452
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 7.at n=20A043844
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 8.at n=20A043851
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 9.at n=20A043859
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 10.at n=20A043868
- Number of 2n-bead balanced binary necklaces of fundamental period 2n which are equivalent to their reverse, complement and reversed complement.at n=29A045683
- Numbers that are repdigits in base 4.at n=21A048329
- a(n) = a(1) + a(2) + ... + 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=16A049904
- Expansion of 1/((1 - x)*(1 - 2*x^2)).at n=26A052551