14033
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14034
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14032
- Möbius Function
- -1
- Radical
- 14033
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 195
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1656
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=33A020384
- Multiplicity of highest weight (or singular) vectors associated with character chi_65 of Monster module.at n=38A034453
- Primes which when converted to base 36 make single letters or English words.at n=41A038842
- Numbers having four 2's in base 9.at n=3A043464
- Primes such that prime(p) +- pi(p) are simultaneously prime.at n=28A065117
- The first of two consecutive primes with equal digital sums.at n=32A066540
- a(1)=1, a(2)=2, a(n+2)=(a(n+1)+a(n))/2 if a(n+1)+a(n) is even, a(n+2)=(3*(a(n+1)+a(n))+1)/2 otherwise.at n=27A069162
- a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=46A089577
- Molien series for symmetrized weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.at n=40A092549
- Indices of prime Pell numbers.at n=25A096650
- Squares of the norms of Gaussian primes from A107629.at n=29A107630
- Row sums of triangle A117265.at n=5A117266
- Right truncatable primes in base 9 (written in decimal form).at n=39A129693
- Number of partitions of n into parts with no prime gaps in their factorization.at n=35A137792
- Primes congruent to 11 mod 41.at n=38A142208
- Primes congruent to 15 mod 43.at n=36A142264
- Primes congruent to 27 mod 47.at n=35A142378
- Primes congruent to 19 mod 49.at n=37A142430
- Primes congruent to 41 mod 53.at n=32A142571
- Primes congruent to 50 mod 59.at n=27A142777